(1 pt for each correct answer). For each of the following statements indicate whether it is true, false, or unknown.

1) Every language in PSPACE can be decided in exponential time.

2) Every language in EXP can be decided in polynomial space.

3) Every PSPACE-hard language is also NP-hard.

4) Every language that has an interactive proof system belongs to NP.