6. Use math induction to verify whether the explicit formula is the solution of the given recursive relation: Ifa0=5andan=3an1+4forn1,thenan=73n2 In your proof verify and state following: Verify the basic case P(0) : State the inductive hypothesis for P(k) : Verify P(k)P(k+1) : We need to prove: Verification: The explicit formula is the solutions of the recursive relation