False To find a largest independent set in a tree, count the vertices in odd levels and even levels of the tree and take the larger number. (k) True False If a problem can be solved in polynomial time, it is in NP. (1) True False If P+ NP and a given problem is not in P, then it is in NPp (m) True False If a loop in a program refers to the input size n. then the loop cannot run in O(1) time. (n) True False We can prove that NP C PSPACE. (0) True