Using a single loop (any kind)

public static int largestAscent (int[] xs) Given an array of integers, we can conceptually split it into separate non-decreasing sequences. Each sequence has a first last item, and thus spans some range of values. Find the sequence that has the largest gap from its beginning low-point to its ending high-point, and return this distance. https:/les.gmu.edu/-marks/211/projects/pl.html reasoning sequence largest ascent 12,342,10 155,10,29 8 (10-2) is greater than (4-1) 9 1,5,5,10 counts as one ascent 0 degenerate case: (5-5)-0 Manual Inspection Criteria(5%) Solve this one with a single loop (any kind)