Problem $2$: Given a sorted array of integers created on the heap, its size and a new integer, design a function which will enlarge the array and place the new item in

the appropriate position in the array, so that it remains sorted.

Sample execution: inserting $6$

Original array: $1,3,5,79$

Problem $3$: $($taken from ch$9$ problem $8$ in text$)$ Write a problem that outputs a histogram of student grades for an assignment.

The program should input each student's grade as an integer and store the grade in a vector. Grades should be entered until the user enters a $-1$ for a grade.

The program should then scan through the vector and compute the histogram.

In computing the histogram, the minimum value of a grade is $0$ but your program should determine the maximum value entered by the user.

Use a dynamic array to store the histogram. Output the histogram to the console.

Sample execution:

PLEASE SOLVE IN C$++.$