Write an algorithm that returns the index of the first element that is less than its predecessor in the sequence s1,..., sn. If s is in non-decreasing order, the algorithm returns the value 0....

Write an algorithm that returns the index of the first element that is less than its predecessor in the sequence s1,..., sn. If s is in non-decreasing order, the algorithm returns the value 0. Example: If the sequence is: AMY, BRUNO, ELIE, DAN, ZEKE, the algorithm returns the value 4.