Are each of the following true or false? Write the logical explanation. No points for only true or false. One has been done for you. 1. 3n2+10nlogn=O(nlogn) Answer: FALSE, since n2 (the dominate term on the left) is asymptotically faster growing than nlogn and hence the former cannot be upper-bounded by the later. 2. 3n2+10nlogn=(n2) 3. 3n2+10nlogn=(n2) 4. nlogn+n/2=O(n) 5. 10n+logn=O(n) n+logn=O(logn)n+logn=(logn)n+logn=(n)2n+logn=(n)n+logn=(1)n+logn=(logn)n+logn=(n)