See method fasterLinSearch lignore-this-id-357557] below. This method implements the linear search algorithm to [ignore-this-id-357557] search list for key. However, unlike the usual linear search algorithm, fasterLinSearch() attempts to find key more quickly by performing two [ignore-this-id-357557) comparisons of a list element to key during each pass of the loop. In particular, it compares the elements at ignore-this-id- 357557] indices n and list.size()-1-n each time. If key is equal to one of these list elements, then the corresponding list index is returned. The question is: what is(are) the key operation(s) in this algorithm? Select all that apply. public int fasterlinSearch ArrayList list. Integer key) { for (int n - 0; n list, Integer k ey)