Following is what you are asked to do in this homework:

1. Generate 100,000 random integers between 0 - 1,000,000. (Reference: Textbook pp 109 - 113) Then save them to a text file where each line has 5 numbers per line.

2. Next, read the numbers back into a plain old array of integers. (You are not allowed to use vector or any other STL data structures at this point)

3. Use insertion sort (the most efficient O(n2)sorting algorithm to sort the array. You may find more information about insertion sort from wiki. (https://en.wikipedia.org/wiki/Insertion_sort (Links to an external site.))

4. Then your program asks the user to enter a number between 0 - 1,000,000. The program uses the binary search algorithm to determine if the specified number is in the array or not. In the process of determination, your program should display the search step in details as shown below as an example. In any case, the total number of searching should be less than or equal to log100000= 17(or 18 if not found)

5. Of course, the test driver should maintain a loop asking if the user wants to play again or not after a search successfully completes. Your test set should include at least the following integer numbers { -100, 0, 123456, 777777, , 1000000, 1000001}

Output example:

Please enter a number (0 - 1000000) : 234567

1. 234567 is less than 520349 from randIntArray[50000]

2. 234567 is less than 261002 from randIntArray[25000]

3. 234567 is greater than 126739 from randIntArray[12500]

...

15. 234567 is greater than 234548 from randIntArray [23468]

16. 234567 is less than 234572 from randIntArray[23470]

17. 234567 is less than 234570 from randIndArray[23469]

{Answer: 234567 is not in the list}

PLEASE I NEED HELP ASAP!!! IF YOU HAVE ANY QUESTIONS, I WILL AS SOON AS POSSIBLE!!! THANK YOU!!