Consider this variant of the linear search algorithm which attempts to speed up the search by reducing the number of iterations of the for loop by approximately one-half. Note that during each pass of the loop, the algorithm compares the elements at i and pList.size0-1-i to pKey for equality publie int 1inearSearch2 (ArrayList pList, Integer pKey) for (int i-0; i