a$)$ What is the height of the recursion tree for rendering a snowflake of LoD $n?$

$logn$

$n$

$3n$

$4n$

b$)$ How many nodes are there in the recursion tree at level i$,$ for $0in?$

$3^i$

$4^6$

$4^{i+1}$

$3*4^i$

c$)$ What is the asymptotic rendering time $($triangle count$)$ for a node in the

recursion tree at level $i,$ for $(1)(\frac{1}{9})(\frac{1}{3})(\frac{4}{9})(3^i)(4^i)n(1)(n)(\frac{4}{(3{)}^n})(4^n)0i$

$0$

$(\frac{4}{9})$

$(3^i)$

$(4^i)$

$e0i?$

$0$

$(1)$

$(\frac{1}{9})$

$(\frac{1}{3})$

$d$