+ Question-1 int arr[] ={1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49}; Keys: 17 37 42 Algorithm Lab Taks Instructions: Implement a binary search algorithm in C++. Code- Search for the key 17 in the array and print the index of the key. If not found, then print "Not Found." Search for the key 37 in the array and print the index of the key. If not found, then print "Not Found." Search for the key 42 in the array and print the index of the key. If not found, then print "Not Found." Find the range of elements in a sorted array greater than or equal to a given key 17. Find the range of elements in a sorted array that are less than or equal to a given key 37. Output Screenshot-