3a. Give a recursive algorithm for finding nx whenever n is a is a positive integer and x is an integer, using only addi
Posted: Wed Jul 06, 2022 12:05 pm
3a. Give a recursive algorithm for finding nx whenever n is a is a positive integer and x is an integer, using only addition. (So, you want to find n times x, when inputting n and x.) 3b. Prove your algorithm in #3 is correct using induction on n.