Inputs: * Water Meter Reading at the beginning of the year (i.e. January 1) * Water Meter Readings at the end of each of the 12 months * Payment Rates (Minimum Bill, price of water per cubic meter) Outputs: * Cubic meters of water consumed for each month (monthly consumption) * Amount paid for each month based on given rates (monthly payment) * Average of monthly consumptions * Average of monthly payments * The month during which the amount of water consumed is highest * The month during which the amount of water consumed is lowest Algorithm 1.Read the name of the water consumer (consumer). 2.Read The classification (cType) of the consumer such that the only valid values for cType is "commercial" or "residential" 3.Read water meter reading in cubic meters at the beginning of the year(previousR[0]). 4.For month 1 to 12 Read the water meter reading in cubic meters at the end of the month (presentR) such that presentR cannot be less than previousR. Store the value in an array. Please complete this part of the program:
Inputs:
* Water Meter Reading at the beginning of the year (i.e. January 1)
* Water Meter Readings at the end of each of the 12 months
* Payment Rates (Minimum Bill, price of water per cubic meter)
Outputs:
* Cubic meters of water consumed for each month (monthly consumption)
* Amount paid for each month based on given rates (monthly payment)
* Average of monthly consumptions
* Average of monthly payments
* The month during which the amount of water consumed is highest
* The month during which the amount of water consumed is lowest
1.Read the name of the water consumer (consumer).
2.Read The classification (cType) of the consumer such that the only valid values for cType is "commercial" or "residential"
3.Read water meter reading in cubic meters at the beginning of the year(previousR[0]).
4.For month 1 to 12
Read the water meter reading in cubic meters at the end of the month (presentR) such that presentR cannot be less than previousR. Store the value in an array.
Please complete this part of the program:
Step by step
Solved in 2 steps with 3 images