1. (30 points) Suppose we are comparing the implementations of Algorithm A and Algorithm B on the same machine. For inputs of size n, Algorithm A runs in 2n steps; and Algorithm Bruns in 5vn steps. a) (20 points) Draw plots of f(n)=2n and g(n) = 5Vn b) (5 points) For which values of n does Algorithm A beat Algorithm B? 1. (30 points) Suppose we are comparing the implementations of Algorithm A and Algorithm B on the same machine. For inputs of size n, Algorithm A runs in 2n steps; and Algorithm B runs in 5vn steps. a) (20 points) Draw plots of f(n)-2n and g(n) = 5vn b) (5 points) For which values of n does Algorithm A beat Algorithm B? c) (5 points) Which function grows faster? What does it tell us about algorithms' efficiency