Answer the following:
Which one of the following statements (s) is/are FALSE?
- Overlaying is used to run a program, which is longer than the address space of the computer.
- Optimal binary search tree construction can be performed efficiently by using dynamic programming.
- Depth first search cannot be used to find connected components of a graph.
- Given the prefix and postfix walls over a binary tree, the binary tree can be uniquely constructed.