USE A KEYBOARD. DO NOT USE HANDWRITING. Question 1) To solve a problem (for instance, sorting an array), we can use two algorithms A and B. 1-1) Algorithm A has the running time f(n) = 400 log(n) and Algorithm B has the running time g(n) 2. For what input sizes is A better than B? For what input sizes should we use B instead of A? Please explain. (3 points) EXPLAIN YOUR ANSWER. 1-2) Algorithm A has the running time f(n) == n3 and Algorithm B has the running time g(n) = 400Vn. For what input sizes is A better than B? For what input sizes should we use B instead of A? Please explain. Symbol V shows Square root of n. (3 points) EXPLAIN YOUR