6. The Ackermann's function is given: 2n if m=0 o if m > 1 and n = 0 A(m, n) = 2 if m 1 and n = 1 A(m 1, A(m, n 1)) if m > 1 and n > 2) Use principles of structural induction to prove that A(1, n + 1) = 2 * 2" for all non-negative integers n. Show all your steps! Verify the basic case: State the inductive hypothesis: Inductive step - state what needs to be proven and prove it