The following two algorithms claim to solve the same problem. To do so, the two algorithms receive as their input a list of integer List[] and an integer number n. Algorithm: A1(int[] List, int target) { int first = 0; int last = List.length - 1; int mid = 0; while (first