Write a method named longestSortedSequence that accepts an array of integers as a parameter and that returns the length of the longest sorted (nondecreasing) sequence of integers in the array. For example, if a variable named array stores the following values:

int[] array = {3, 8, 10, 1, 9, 14, -3, 0, 14, 207, 56, 98, 12};

then the call of longestSortedSequence(array) should return 4 because the longest sorted sequence in the array has four values in it (the sequence -3, 0, 14, 207). Notice that sorted means nondecreasing, which means that the sequence could contain duplicates. For example, if the array stores the following values:

int[] array2 = {17, 42, 3, 5, 5, 5, 8, 2, 4, 6, 1, 19}

Then the method would return 5 for the length of the longest sequence (the sequence 3, 5, 5, 5, 8). Your method should return 0 if passed an empty array.

Write a main procedure that reads integers from the console and fills the array with those integers (It should first prompt for the number of values to read). It should then call longestSortedSequence, passing the array and printing the returned value.

The method signature for longestSortedSequence is:

public static int longestSortedSequence(int[] theArray)

Example run:

Number of values: 10

Value 1: 5

Value 2: -3

Value 3: -1

Value 4: 8

Value 5: 4

Value 6: 7

Value 7: 10

Value 8: 14

Value 9: 18

Value 10: 5

The longest sorted sequence is 5