PLEASE GIVE PSEUDOCODE TO REPRESENT ALGORITHM

9. An array is called almost increasing" if it is in increasing order, or after swapping a pair of elements, the array becomes in increasing order. For example, the array(1,3,50,6,8,20,5] is almost increasing, since after swapping 50 and 5, the array becomes in increasing order. Write an algorithm, given an array A[O...n-1), determine whether the array is almost increasing. If yes, output Yes, otherwise output No