Question 8 1 pts Given the algorithm below, what is the maximum number of times the basic operation is executed? ALGORITIM Mystery(arr. size XX Input: An array of non-hecative integer numbers, 1 size and an integer Value 1 while (i size) ir (arr[1]) return return -1 size-1 size+1 size Question 7 1 pts Given the algorithm below, what is its basic operation? its size ALGORITHM Enigma(arr. size) Input: An array of non-negative Integer numbers, S- arr[@] for 11 ta size I do If arr[1] CE-> U->>E-> N Next Previous