Problem 3: (25 pts) Consider the problem of counting, in a given text, the number of substrings that start with an A and end with a B. For example, there are four such substrings in AACBB. Design an algorithm for this problem and determines its efficiency. What is the time efficiency of the algorithm? Problem 2: (25 pts) 1. List the following functions according to their order of growth from the lowest to the highest. n, In(n +10), 1.2, 0.1n+1, In2 n, Vi, 2 2. If we define sparse graphs as graphs for which E E O(IVID, which implementation of DFS will have a better time efficiency for such graphs, the one that uses the adjacency matrix or the one that uses the adjacency lists? IS Problem 1: (25 pts) Consider the following recurrence T(n) = 12Jeft where Piet + yight n. Solve it for the best (fastest) and worst (slowest) cases. Answer 2