Q5 Extra Credit O Points This questions is for extra credit. it's worth 20 points in total. Because of the way Gradescope is set up, it is currently shown as points and we will add the extra points when grading. Suppose you are given 2 algorithms that solve the same problem. Algorithm A solves the problem by dividing it into 3 subproblems of half size and then calling itself to solve each subproblem and combining the solution in (n) time, Algorithm B solves the problem by dividing it into 4 subproblems of 1/4 size and then calling Itself to solve each subproblem and combining the solution in O(n) time. Which algorithm runs faster and why? Do not use master's theorem for this question. Enter your answer here Please select file(s) Select file(s)