Q$1$

$3$ Points

Recall our initial induction problem from class, where there is an infinite row of lilypads in a pond.

Your goal is to prove the statement that Fred can jump to the $n^{th}$ lilypad, for all $n1.$

Suppose you are able to prove that if Fred can jump to the $(n-4{)}^{th}$ lilypad and the $(n-2{)}^{th}$

lilypad, he can jump to the $n^{th}$ lilypad. Which base case$($s$)$ do you need to show to prove via strong

induction that the statement is true for all $n1?$ Select all that apply.

Q$1\mathrm{.}1$

$0\mathrm{.}5$ Points

$n=0$

Base case

Not a base case

Q$1\mathrm{.}2$

$0\mathrm{.}5$ Points

$n=1$

Base case

Not a base case

Q$1\mathrm{.}3$

$0\mathrm{.}5$ points

$r-2$

Base case

Not a base case

Q$1\mathrm{.}4$

$0\mathrm{.}5$ Points

$n=3$

$,$ Base case

Not a base case

Q$1\mathrm{.}5$

$0\mathrm{.}5$ Points

$n=4$

Base case

Not a base case

Q$1\mathrm{.}6$

$0\mathrm{.}5$ Points

$n=5$

Base case

Not a base case