index local minimum if [iis less than or equal to its neighbors how would you efficiently find local minimumif one existsvariantwrite program which takes sorted array of integersand an integer kand returns the interval enclosing ki the pair of integers and such that is the first occurrence of in and is the last occurrence of in if does not appear in areturn [- - for example if and you should return [ variantwrite program which tests if is prefix of string in an array of sorted strings