Which of the following statements is false ?
a)Optimal binary search tree construction can be performed efficiently using dynamic programming
b)BFS can not be used to find connected components of a graph
c) Given the prefix and postfix walks of a bianry tree , the tree can not be re-constructed uniquely
d)DFS can be used to find connected components of a graph