TF(logn)log3n=O(23logn) TFnloglogn=O((logn)logn) T F Let E[X] denote the expected value of a random variable X. Then E[X+ Y]=E[X]+E[Y] (even if X,Y are not independent). T F The number of k-element unordered samples with repetitions from an n element set is (nk) TF If f(n)=f(n/2)+n then f(n)=(logn) TF If f(n)=f(n/2)+3 then f(n)=(logn) T F On a connected graph G, BFS runs in time O(m), where m is the number of edges T F A heap of n elements can be constructed in time O(n) T F The average-time complexity of InsertionSort is O(nlogn)