Develop a C-program that helps user managing an 1-D array of integer numbers (maximum of 100 elements) , with initial number of elements is 0, using the following simple menu: 1-Add a value
2-Search a value
3-Remove the first existence of a value
4-Remove all existence of a value
5- Print out the array
6-Print out even values in array
7-Print out the maximum value of the array
8-Print out values in a range
9- Print out the array in ascending order (bubble sort)
0- End.

-When the option 1 is chosen, user will enter a valid value then it is added to the end of the array.
-When the option 2 is chosen, user will enter a valid value. If that value exists in the array, the program will print out all the locations of that value, otherwise it will print the message not found.
-When the option 3 is chosen, user will enter a valid value. If the value exists in more than one position, delete the first number. If the number does not exist, print the message not found.
-When the option 4 is chosen, user will enter a valid value. If the value exists in more than one position, delete all those values.
-When the option 5 is chosen, the values in the array will be output.
-When the option 6 is chosen, even values in array will be printed out.
-When the option 7 is chosen , the maximum value in the array will be printed.
-When the option 8 is chosen, user will enter 2 values, minVal and maxVal, the values in array which are between minVal and maxVal are printed out (minVal <=value<=maxVal).
-When the option 9 is chosen, values in array will be printed out in ascending order (Note: sort on sub-array, use bubble sorting algorithm).
-When the option 0 is chosen, the program ends.