USE JAVA ONLY.

Requirement: Solve this one with a single loop (any kind).

Test to pass: https://repl.it/@tom_don/t5

Thank you

Task 5: More Complex Array Usage public static boolean anyDuplicates (int[] xs) Given an array of integers, if the same value occurs twice anywhere, return true; if not, return false. reminder: Although Python used upper-case words (True and False), we're not writing Python! In Java, the boolean values are written all lowercase: true, false. 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 and 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. Examples: sequence largest ascent 1,2,3,4,2,10 1,5,5,10,2,9 reasoning 8 (10-2) is greater than (4-1) 9 1,5,5,10 counts as one ascent. 0 degenerate case; (5-5)0