In the "Linear Search' subsection of the "Cammon Array Algorithms\" section, you learned how ta 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 cade. 1 import java.util.Scanner; 2 3 public class FindNext 4f g fee 6 Finds the next occurrence of an element in an array. 7 @peram values an @errey of values 3 apa 1 SearchedValue the value to search for 9 Qpoaram stert the position at which to stort the search 18 @return the position of the first match ot position = start, 11 or -1 if the element was not found 2 *f 13 public static int findNext(int values, int searchedValue, int start) 14 { 15 /* Your code goes here */ 16 } 17 18 public static void main(String args)