3) Which one of the following statements is always correct? Answer: ) (A) Dynamic programming approaches are "bottom-up" and thus cannot have recursive implementations. (B) A leaf node on a depth-first-search tree is the furthest from the tree root, and thus in the original graph, there cannot be an edge linking this leaf node and the root node. (C) A Red-Black tree is a binary search tree. (D) The dynamic programming solution to matrix-chain multiplication works only for matrices of integer elements. (E) None of the above is always correct