Which of the following statements is true when algorithms are designed?

Any algorithm that has been already designed can always be improved on

Of the two resources, space and time, it is impossible to sacrifice one for the other

All algorithms become more efficient by implementing Time$-$space tradeoffs

Algorithms are static in nature. A running program cannot be improved upon