There are N numbers of visitors in Muscat festival, Manager wishes to search particular visitor information based on visitor ID. Consider the records are already arranged in ascending order bascd on...

There are N numbers of visitors in Muscat festival, Manager wishes to search particular visitor information based on visitor ID. Consider the records are already arranged in ascending order bascd on visitor ID. Use this scenario to answer the below assignment questions. 1. Explain the steps for the following operations using binary scarch. 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. 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. Note: 1. N value must be at least 7. 2. Use your own data for visitor ID and it must be 4 digit number. Please i need answer same way through by picture please please.


Extracted text: Binary Search search element 80 Step 1: search element (80) is compared with middle element (50) 0 1 2 3 45 6 7 8 list 10 12 20 32 50 55 65 80 99 80 Both are not matching. And 80 is larger than 50. So we search only in the right sublist (i.e. 55, 65, 80 & 99). 0 1 2 3 list 10 12 20 32 50 55 65 80 99 5 6 7 8