Select all the statements below which are TRUE: Consider two sequences X and Y that both start with A. Then any Longest Common Subsequence (LCS) of X and Y must start with A To show that a greedy algorithm always yields an optimal solution, we need to prove the greedy-choice property. We do not need to prove the optimal substructure property Let G be an undirected graph. In the adjacency-list representation of G, the sum of the lengths of adjacency lists is El. In the worst-case, the height of a Binary Search Tree (BST) is (n), where n is the number of nodes in the tree If BELLMAN-FORD(G,w,s) returns FALSE, then it means that the graph G has a negative-weight cycle reachable from s. Let G be an undirected graph. Then running Depth-First Search (DFS) on G can result in cross edges