Write a method longestSortedSequence that
returns the length of the longest sorted sequence within a list of integers.
For this problem sorted means non-decreasing. For example, if a variable
called list stores the following sequence of values:

(1, 3, 5, 2, 9, 7, -3, 0, 42, 308, 17)

then the call:

list.longestSortedSequence()

would return the value 4 because it is the length of the longest sorted
sequence within this list (the sequence -3, 0, 42, 308). If the list is
empty, your method should return 0. Notice that for a non-empty list the
method will always return a value of at least 1 because any individual
element constitutes a sorted sequence.

You are writing a method for the IntList class discussed in lecture
(handouts 3 and 5):

public class IntList {
private int[] elementData; // list of integers
private int size; // current # of elements in the list
<methods>
}

You are not to call any other IntList methods to solve this problem. You
also may not use another data structure like a temporary array and your
method must run in O(n) time where n is the size of the list.

Write your solution to longestSortedSequence below.