A1 (20 points): Draw the recursion tree for T (n) = 4T () + on, where c is a constant, and provide a tight asymptotic bound on its solution. You need to show the detailed process that includes the following elements. 1) A drawing of the recursion tree. 2) A summation process that shows the number of nodes at each level of the tree; the number of nodes at each level of the tree, the height of the tree; and the cost (i.e., the number of nodes and the cost of each node) at the last (bottom) level of the tree. Identify the pattern and solve the summation equation. 3) Validation of your solution using the substation method