Let us call an array bitonic when the values strictly increase and then strictly decrease. For example, $[1,5,7,9,8,2]$ and $[3,4,5,1]$ are bitonic, but $[1,3,5,7],[1,5,5,2]$ and $[5,2,1,3]$ are not.

Write an algorithm in pseudo$-$code which:

inputs a non$-$empty array A$[1...$n$],$ n $>2$

returns true if A is bitonic, false otherwise.