Select all the statements below which are TRUE Consider two sequences X and Y that both end with A. Then any Longest Common Subsequence (LCS) of X and Y must end 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 2El. O Dijkstra's algorithm is used to computej a minimum spanning tree for a graph G, where G is undirected and weighted, and all the edge weights are nonnegative. TREE-INSERT(Tz) is the insert operation for Binary Search Trees (BST). TREE-INSERT(T,z) has the worst-case running time O(lgn), where n is the number of nodes in the tree. O Let G be an undirected graph. Then after running Depth-First Search (DFS) on G, every edge of G is either a tree edge or a back edge