Plz do fast

4 student who satisfactorily completes the assignment should be able to: Learning Objective 1. Use arrays, Pointers, Structures and Abstract data types 2. Use Linear and Binary Search 3. Implement hashing techniques 4. Use algorithms to perform operations such as insertion, scarching, updating and deletion on various data structures S. Implement data structures. Course Outcome No. 1 6 11 12 13 Problem: There are N numbers of visitors in Muscat festival, Manager wishes to search particular visiter information based on visitor ID. Consider the records are already arranged in ascending order based on visitor ID. Use this scenario to answer the below assignment questions. 1. Explain the steps for the following operations using binary search. (2 marks) 2. Search for any visitor ID which is available in the list. b. Search for any visitor ID which is not available in the list. 2. Use Mid-Square Hashing Technique to explain the following (2 marks) a Place all the records into the hash table. b. Use linear probing or chaining technique to eliminate collision. 3. Write your own hash function (1 mark) Note: 1. N value must be at least 6. 2. Use your own data for visiter ID and it must be 3 digit number