Write a program that will implement a binary search. You program should store 40 numbers. The 40 numbers will be initialed in an array (See Below). Your program should read in each number, call a binary search, and Indicate if the number is found and if so where or if it is not in the list. Your program should also print the number before the number that was found and the number. For example, if you search for 31, then your program should display that 31 was found and the number before it is 29 and the number after it is 33.
int list[20] { 1, 4, 5, 6, 9,11,14,17,19,20, 22, 24, 25, 29, 31, 33, 35, 38, 40, 43, 45, 47,49, 50, 51, 55, 57 , 59, 61 , 63, 67, 69, 70, 72, 74, 77, 79, 80, 85, 92 }.