Consider the following algorithm where P and S are arrays of characters (i.e., strings), and answer the questions below. The notation represents logical negation (i.e., flip the proceeding variable value from true to false, or visa versa) Require: P[0,..., m - 1], S[1,...,n], for 1 n - m on termination. Show your work. (f) (2 points) What is a best-case runtime scenario? Explain (g) (2 points) What is a worst-case runtime scenario? Explain (h) (7 points) Prove a tight bound for the worst-case runtime. Show all your work