PID:

$3.$ Nultiple Choice$/$True Fealse: $($Circle the correct selection for each part. No jusufication necessary.$)($each problem is $1$ point.$)$

$($a$)$ points$)$ For any real number $c>0,$ were is a version of Cook$-0$ Tom that will Ium in time $O(n^{1+c}).$

True In $T(1)=S(1)=c,$ what is true about $T(n)$ and $S(n)?$ that $T(1)$ that apply$)($circle all that

$T(n)=(S(n)),T(n)=S(S(n))$

$($circle $x)$

$T(n)=O(S(n))$

False

$($c$)(1$ point$)$ If an algorithon has an approximation ratio of $2$ then it vill never find an optimal soltit

True case runtime of $(nlogn).$

True

$($e$)$ point$)$ In an algorithm rumtime recutrence $($where a$,$ b$,$ d

then you can use master theorem to solve this.

True