1 pts Given the algorithm below, how many times the basic operation is executed? ALGORITHO Secret Carri, arr. size) Input: Two arrays of non-negative Integer numbers, and their size SK for 1e to size do Se 5+ (arra11-orr-2 neturn sort(s) size-1 OS size sire 1 ALGORITHM Mystery(arr. size, x V Input: An array of non negative Interer numbers. Itsiz, and an integer valu 1 0 while (512) if Kart1)) return 1 1+ return- (n) (n) (logn) (n log n) Next Previous Not saved Submit Quiz 1 pts Given the algorithm below. what is the efficiency class of this algorithm? ALGORITARE (or size) W taputt array of nonnective Integer numbers and its size 5 Harro for inte i 1 do if a1135 then Sarr (1) ceturns e(n) de(n) (logn) en logn) Next Previous o