With C++

I. 120 points] Write a program to determine the largest number of overlapping closed iser- vals with integer upper and lower bounds between 0 and 99, then output the inmervals that are overlapped to that degree. Use an array of size 100 to tally the number of times that an integer is in an interval. The imervals are read util the user enters a value thar is ou of bounds. CPSC 1620 Sample Runs /aBs overlappingintervals Enter a list of integer delimited closed intervals one per line, that are subintervals of 0.991 Enter-1 to stop) Interval (eg: 7 10): 3 97 Interval (eg: 7 10): 5 55 Interval (eg: 7 10): 60 72 Interval (eg: 7 10): 35 82 Interval (eg: 710):-1 The largest number of overlapping intervals is 3. (35, 551 60, 72] /a8s overlappingintervals Enter a 1ist of integer delimited closed intervals one per line, that are subintervals of [0.991 Enter-1 to stop) Interval (eg: 7 10): 48 Interval (eg: 7 10): 25 89 Interval (eg: 7 10): 101 The largest number of overlapping intervals is 1. 4, 81 125,891 /aBS overlappingIntervals Enter a list of integer delimited closed intervals one per line, that are subintervals or [0.991 (Enter-1 to stop) Interval (eg: 7 10): -32 The largest number of overlapping intervals is 0 0,99) /a8s overlappingIntervals Enter a list of integer delimited closed intervals one per line, that are subintervals of [0,99]. Enter-1 to stop) nterval (eg: 7 10): 3 8 Interval (eg: 7 10): 8 49 Interval (eg: 7 10): 7 90 Interval (eg: 7 10): 200 The largest number of overlapping intervals is 3 8.81