$[5$ pts$]$ Use mathematical induction to show that $n!2^{n-1}$ for all $n1$

$[5$ pts$]$ Give the Big $O($complexity order$)$ of the following code segment$[5$ pts$]$ An ice cream shop has a special ice cream deal on Tuesdays. It sells single scoops of ice cream from the choices Chocolate, Strawberry, and Vanilla, on a waffle cone or a sugar cone. Also, the customer may pick one of three toppings: nuts, cherries, or sprinkles. How many different single$-$scoop, single$-$cone, single$-$topping ice cream constructions are possible?