PLEASEEE HELP ME ASAP!!!

Instructions:

1. You are required to study bubble sort and binary search (Refer references).
2. Upon submission, please submit a report (in PDF format) that contains the following:

1. About Bubble Sort Technique (2m)
2. About Binary Search Technique (2m)
3. Explain your solution of the given problem statement. (9m)

Problem Statement Given two arrays: int list1[] = {90, 20, 80, 60, 10}; int list2[] = {90, 200, 820, 1060, 1110}; Analyse the example of execution (refer page 3 and page 4). By using modular programming, write a program that able to perform operations according to user's input. If the user enters a letter a or A, the program will performs bubble sort on list1 and display all elements in ascending order. If the user enters a letter s or S, the program will performs binary search on list2. When the user enters a letter X or x, the program will be terminated. However, if the user enters invalid choice, the program will inform the user and ask to reenter the valid input. Example of execution: You want to find: 80 Not found What you want to do (A for Sort,S for Search, X for Exit the Program:) S You want to find: 1060 1060 is found at index 3 What you want to do (A for Sort, S for Search, X for Exit the Program:) A Original order: 90 20 80 60 10 Sorted Array in Ascending Order: 10 20 60 80 90 What you want to do (A for Sort,S for Search, X for Exit the Program:) a Original order: 90 20 80 60 10 Sorted Array in Ascending Order: 10 20 60 80 90 What you want to do (A for Sort,S for Search, X for Exit the Program:) x Thank you! Have a nice day! What you want to do (A for Sort, S for Search, X for Exit the Program:) Sorry. This is an invalid choice. What you want to do (A for Sort,S for Search, X for Exit the Program:)