CS2308 Programming Project 1: The Searching Techniques Reference: Chapter sections 8.1 and 8.2 (earching) And Progr 8-2, 8-3 as good examples a. Create three array of 12+ students records includtng ID's, student names, and the corresponding e-mail addresses,- student ID's are sorted in order b. sequential search five ID's which are from the sorted array and a c. Binary Search five ID's which are from the sorted array and a 6th d. Execution and output: 6th ID which is not from the array. ID which is not from the array 1. Display the original sorted array of student records. 2. Display the sequential search result of student records 3. Display the binary search result of student records. e. Turn in source programs and the outputs of item (e) f. The following should apply to all assignments during the semester. Turn in with hard copy and must be professional and the turn in should include the source Program, and the displayed outputs as described above. Proper messages in the output are required to indicate the execution and different outputs. Turn in all assignments in class. It will have late penalty 10% if your turn in 30 minutes after elass begins and before class of next assignment due day. g. Anything not mentioned in this assignment, you are free to do whatever you desire. No need to ask questions