Given the algorithm below, what is its basic operation? ALGORITH Mysterycurt size. X 1/ Inputt an array of non-negative integer numbers. Its size, and an integer value 1 C D while (test) If (arr11 return 1 return -1 OTO e arrix returni return-1 D Question 2 1 pts What data structure is used to implement the Depth-First Search? Queue Stack Binary trees Priority queue Next Given the algorithm below, what does this algorithm compute? ALGORTH Secret(arei, , si w Input we array of non-negative integer numbers and their site SO for 1 tasaze-1 do SRS Carrilare (172 un sets) Hamming Distance Euclidean distance Minkowski Distance (order 3 or higher Manhattan distance