C programming

In this assignment, you will focus on implementing the basic algorithms we learned in this class. Each algorithm should be implemented as a separate function, which accepts an array as an argument -if necessary. The functions do not need to return a pointer to arrays, rather each function will print the results immediately (See the figures). In particular, your application must start by printing the following menu items to the user 0. Print the current array 1. Enter the values of the array 2. Search for a number using Sequential Search. 3. Search for a number using Binary Search. 4. Sort the elements of the array using Selection Sort. 5. Sort the elements of the array using Bubble Sort. 6. Find the Minimum and Maximum values in the array Based on each selection, call the corresponding function and pass the array to it. Once the functionality is executed, CLEAR the screen and ask the user if they want to make another operation. If yes, display the above menu again. If no, simply exit the program. More details on each option is given in the following Option Zero [0]: If the array is still empty, print a message indication that. Otherwise, print the current values inside the array https /C-language gharibgharibi.repl.run gce version 4.6.3 Select an option e. Print the current Array 1. Enter the values of the array 2. Search for a number using Sequential Search 3. Search for a number using Binary Search 4. Sort the elements of the array using Selection Sort 5. Sort the elements of the array using Bubble Sort 6. Find the Minimum and Maximum values in the array > e Sorry, No elements in the array, yet! Back to main menu? [yes: Y Np: N]