Please Give the correct answer

rrect Question 3 0/12.5 pts Select the best answer from each dropdown menu. Examine this algorithm. Given a sequence A and an element e, this algorithm returns the smallest index of e in Sequence A if A contains e. If A does not contain e, this algorithm returns -1. find-Element (e,A) index 1 while ((index S A. length) and (A[ index), e)) index index 1 if (index A.length) index-1 return(index) Given this problem instance with an n-items sequence and a number e. In the best case, the number of comparisons for this algorithm will grow as n Incorrect Question 6 0/12.5 pts Select the best answer from each dropdown menu. Examine this algorithm. Given a sequence A and an element e, this algorithm returns the largest index of e in Sequence A if A contains e. If A does not contain e, this algorithm returns -1. find-Element (e,A) index A. length while ((index > 0) and (A[index]t e)) index - index - 1 if (index A. length) index -1 return(index) Given this problem instance le-3, A (3, 7, 54, 2, 100, 2, 45)], this algorithm will execute 2 comparisons and will return 1 Answer 1: Answer 2: rect Question 9 0 12.5 pts Select the best answer from each dropdown menu. Examine this algorithm. Given a sequence A and an element e, this algorithm returns the smallest index of e in Sequence A if A contains e. If A does not contain e, this algorithm returns -1. find-Element (e,A) index 1 while ((index s A. length) and (Al index] e)) index -index + 1 if (index > A.Length) index -1 return(index) Given this problem instance with an n-items non empty sequence and a number e. This algorithm will perform at least 2 comparisons Question 10 0/12.5 pts Select the best answer from each dropdown menu. Examine this algorithm. Given a sequence A and an element e, this algorithm returns the smallest index of e in Sequence A if A contains e. If A does not contain e, this algorithm returns -1. find-Element (e,A) index -1 while ((index s A. length) and (Alindex] e)) index -index 1 if (index > A.length) index -1 return(index) Given this problem instance with an n-items sequence and a number e. This algorithm will perform on average (2n+1)/2 comparisons. Answer 1