Answer TRUE or FALSE for each of the following. Give brief explanations for your answers. 1. (n9) is O(n9). 2. n3logn is (n3.01). 3. n ! is O(2n). 4. If f(n) is O(g(n)) then 2f(n) is O(2g(n)). 5. Depth first search runs in O(m+1) time for a connected graph. Here m is the number of edges in the graph