Find the solution to the recurrence relation by using an iterative approach.

Identify the missing steps, denoted by A and B$,$ for the recurrence relation an $=($n $+1)$an $1$ with the initial condition a$0=2.($Check all that apply.$)$

an $=($n $+1)$an $1$

$=($n $+1)$nan $2$

$=($n $+1)$n$($n $1)$an $3$

$=($n $+1)$n$($n $1)($n $2)$an $4$

$=$ continuing in the same manner

$=($n $+1)$n$($n $1)($n $2)($n $3)($n $($n $2))$ an $$ n

$=$ A

$=$ B

Check All That Apply

A $=($n $+1)$n$($n $1)($n $2)($n $3)2$ a$0$

A $=($n $+1)$n$($n $1)($n $2)($n $3)2$ a$0$

A $=($n $+1)$n$($n $1)($n $2)($n $3)$ a$0$

A $=($n $+1)$n$($n $1)($n $2)($n $3)$ a$0$

B $=2($n $+1)!$

B $=2($n $+1)!$

B $=($n $1)!$

B $=($n $1)!$