Exercise 8 (1 pt for each correct answer). For each of the following statements indicate whether it is true, false, or unknown. 1. If SAT can be solved in polynomial time, then P EXP 2. Every language in EXP has an interactive proof system. 3. The TQBF problem is PSPACE-complete. 4. The TQBF problem is NP-hard