C++: Create a program that will have an array or vector of 1,000 elements. The information can be random assigned into the list. Use at least 2 of the sort algorithms (bubble, selection, insertion, quicksort, merge sort). Use the binary search to find an element in the list. Display how many loops it took to find (or not find) the element. For instance, if you have the assignment to be an integer between 0 and 10,000, then you can have it search for 7893 to see if it appears in the list. Use functions in this program.