Prove that the following algorithm meets its postcondition or provide a failing counterexample.

I need a well detailed steps and answer so I can know and understand each step.

Prove that the following algorithm meets its postcondition or provide a failing counterexample. Precondition: A[1..n], n > 0, is sorted with distinct values ascending to a high value and then descending, so 3k, 1 sk sn| Vi s j A[m + 1] Postcondition: Returns the highest value in A[1..n] function HighPOINTSEARCH (A[1..n]) if n=1 then return A[1] ma if A[m]