True or false:

1.  The time complexity of an algorithm is always at least as great as
the space complexity of that algorithm.

2.  The space complexity of an algorithm is always at least as great as
the input size.

3.  Given a program, it is always possible to analyze the time and space
complexity of that program.