Each recursive call solves an different,but

smaller problem.

Select one:

True

False

Question $4$

Not yet answered

Marked out of $0\mathrm{.}50$

Flag question

Question text

What is the time complexity of Towers of

Hanoi algorithm?

$9.$

O$(1)$

b$.$

O$($logN$)$

C$.$

none of the above

d$.$

O$($N$)$

e$,$

O$($n$3)$

f$.$

O$($n$2)$

O$(2$n$)$

g$.$

Clear my choice

Question $5$

Not yet answered

Marked out of $0\mathrm{.}25$