Q.1.(20 pnt) Write the General case. Best case. Worst case running times and the order of growths of the following algorithms. a) Algorithm Even_numbers(A[1...]) 1. sumo: 2. io; 3. While (in) 4. sumsum+AU 5. 8. return sum General case: Best case: Worst case: b) Algorithm Sum(A[1...]. B[1..n]) 1. sumo: 2. i 1: 3. while ((Ali