a peak element element strictly great neighborsgiven 0indexed integer array num find peak element return index if array contain multiple peak return index peaksyou imagine nums1 numsn in word element consider strictly great neighbor outside arrayyou write algorithm run Olog n time Example 1input num 1231output 2explanation 3 peak element function return index number 2example 2input num 1213564output 5explanation your function return index number 1 peak element 2 index number 5 peak element 6 Constraints1 numslength 1000231 numsi 231 1numsi numsi 1 valid