Ceil of an element in a Sorted ArrayGiven an array and a key, find the smallest element greater than the key. This is known as Ceil.The problem can be solved using binary search.In the provided example, the ceil of 5 in the array {1, 2, 3, 4, 6, 7, 8, 9} is 6.