1 is also true, because TIME is a class of deterministic machines
(i.e., "simple" algorithms) and such machines can invert their output.
More precisely, if L is in TIME(2^(2^n)) then there's a O(2^(2^n))-
time deterministic
machine M that solve L, and then the machine M' that runs M and
outputs the inverse
of what it says, solves \bar L, the complement of L, and runs in
(roughly) the same time.
-- Oded