$(8$ points$)$ Write an algorithm that inputs a number $n$ followed by an array of $n$ numbers

$a_1,a_2,$dots,$a_n$ and outputs the number of values of $i,$ with i between $1$ and $n-1$ such that

$|)$: which

Example $4$:

Input: $n=10$ and the array $of10$ numbers $is80,40,20,19,10,50,12,14,1,22$

Output: $3$

Why $is$ output $3?$ Because moving left $to$ right the there are $3$ positions where $it$ goes $up,$

and