I think i confused and got wrong answer somehow, please help

rrect Question1 0/ 2 pts Consider the relation T (n) = 54T(9) + n4, and you (mistakenly) try to inductively prove that it is T(n) O(n3). You would inductively assume that 54T ( )-m4-x, where x has several terms. After you simplifying a, consider the following two questions. The coefficient of the n4 will be 2 The coefficient of the n3 term will be a constant (to be determined later, from the O () notation's constant), times what coefficient notation answer as an integer, no decimals. ?Write each Answer 1 2 Answer 2: notation Question 2 2 pts You are given the recurrence relation T(n)-4T(n/2) + 3T(n/3) +n. You are going to fill in 3 levels of the recurrence tree, starting with the (trivially easy) root level. The root level has one recurrence term, T(n), and that is all. (You could also consider it to have a linear term with coefficient O.) The next level of the tree has three terms: two recurrence terms (T(n/2) has coefficient 4, and T(n/3) has coefficient 3), and a linear term n (with coefficient 1). Now imagine that you fill in the next level of the tree, summing all like terms to simplify the result as much as possible. Summing all terms at that level, the coefficient in front of the T(n/6) term is (There are other recurrence terms at this level, but I am not asking about them.) Also, for that line, the coefficient in front of the linear n term is . (For the linear term, just include the linear term introduced at that level of the tree, don't include the inear term from the level above.)