In the "Common Array Algorithms" section, you learned how to find the position of an element in an array. Suppose you want to $.$ find the position of the second match. You could remove the first match and start over, but that would be wasteful. Instead, adapt the algorithm from that section so that it starts the search at a given position, not zero. Complete the following code.

import java.util.Scanner;

public class FindNext

$\{$

$\frac{?}{?}****$

Finds the next occurrence of an element in an array.

@param values an array of values

@param searchedValue the value to search for

@param start the position at which to start the search

@return the position of the first match at position $$ start,

or $-1$ if the element was not found

$*/$

public static int findNext$($int $$ values, int searchedValue, int start$)$

$\{$

$Y^{**}$ Your code goes here $*/$