7

6. Define and explain different asymptotic notations along with example for each. Given the following recursive algorithms to compute the minimum element in an array, which algorithm is faster? Prove by setting up and solving the recurrence relation for both the algorithms' basic operation. 7. Algorithm Minl (A[O.n-1]) //Input: An array A[0.n -1] of real numbers //Input: An array A[ ....] of real numbers ifn= 1 Algorithm Min2 (A..) ifl=r else return A[0] return AU tempi Min2 (A [1 if templ s temp2 else else temp Min 1 (AT0.n-2]) if temp S A[n - 1] I (l + r)2]] ) return temp else return templ return A[n -1] return temp2 Traverse the graph given in the Figure 8 using Depth First Search (DFS) and construct the corresponding depth first search tree specifying tree edges and back edges. Give the order in which the vertices were reached for the first time (pushed onto the traversal stack) and the order in which vertices become dead ends (popped off the stack). Start the traversal at vertex A and 8