A run is a sequence of adjacent repeated values (see Exercise R7.21). Describe an O(n) algorithm to find the length of the longest run in an array.

Data from exercise R7.21

A run is a sequence of adjacent repeated values. Give pseudocode for computing the length of the longest run in an array. For example, the longest run in the array with elements 1 2 5 5 3 1 2 4 3 2 2 2 2 3 6 5 5 6 3 1 has length 4.