Caller ID programme

Download the complete Caller ID program. Write a static method totalDurations that is passed the parallel arrays from the main” rel=”nofollow”>in program. It creates a new pair of parallel arrays (phone numbers and
durations, again” rel=”nofollow”>in) where each different in” rel=”nofollow”>incomin” rel=”nofollow”>ing phone number is stored exactly once, and the duration is the total duration of all the calls from that phone number. It then prin” rel=”nofollow”>ints these arrays.
Nothin” rel=”nofollow”>ing is returned.
For example, if the arrays contain” rel=”nofollow”>in 555-1234 (duration 10), 555-4321 (duration 20), and 555-1234 (duration 30), then the output would show 555-1234 (duration 40) and 555-4321 (duration 20).
To help you solve the problem, you can call the fin” rel=”nofollow”>ind method. Use it to check if a phone number has already been placed in” rel=”nofollow”>in the new arrays, and if so, to determin” rel=”nofollow”>ine where that number is. Also note
that the size of the new arrays will never be greater than the current list.
You will need to modify the main” rel=”nofollow”>in program to adequately test your new method. But you should submit only yourtotalDurations method for markin” rel=”nofollow”>ing, by the due date specified in” rel=”nofollow”>in the course schedule.

find the cost of your paper