Write pseudocode for the following insertion function.

Problem: Checking if list A is sorted in descending order or not Input: list A[0...n-1],

 n: the length of list A Output: return true if elements in A are arranged in descending order, 

i.e., A[0]>=A[1]>=...>=A[n-1] return fales if not.

 for example, 1) list A=[9,6,4,1], n=4, the function shall return true 2) list A=[4,6,5,2], n=4, the function shall return false 

 Algorithm: IsSorted (A, n)