Reference: chapter sections 8.3 and 8.4 (sorting) Chapter sections 8.1 and 8.2 (Searching)

USE C++ for this code

A. Create three array of 15+ students records including IDs, the corresponding e-mail addresses, and the corresponding GPAs student IDs not sorted in order.

B. Sort the above data by student IDs using bubble sorting.

C. Sequential Search one ID which is from somewhere in the middle of the sorted array and a second ID which is from near the end of the sorted array and one ID is not from the sorted array.

D. Binary Search one ID which is from somewhere in the middle of the sorted array and a second ID which is from near the end of the sorted array and one ID is not from the array.

E. Execution and output:

1. Display the original unsorted array of student records.

2. Display the sorted array result of student records.

3. Display the sequential search result of student records.

4. Display the binary search result of student records.