$.$ Indicate whether each of the following statements is true or false:

a$.$ If a function is in $\backslash$Theta $($n$),$ then it could also be in O $($n$2$

$)$ TRUE FALSE

b$.$ f$($n$)=80$n$2+$ n

$2$

log n is in O $($n$2$

$)$ TRUE FALSE

c$.$ f$($n$)=$ n

$2+$ log n$2$

is in $($n$)$ TRUE FALSE

d$.$ In a red$-$black tree, a black node must have only red children. TRUE FALSE

e$.$ Using the mod method $(\%)$ for a hashing function, a table size of $64$ would be a good choice. TRUE FALSE