Select all the statements below which are TRUE: Dijkstra's algorithm can be used to compute single-source shortest paths when all edges have negative weights. Let x be a node in a Binary Search Tree. If z is a node in the left subtree of x, then zkey s x.key. To show that a greedy algorithm always yields an optimal solution, we need to prove () the optimal substructure property, and (i) the greedy-choice property. We are given two sequences: X with length 7 and Y with length 4. There are cases when the length of a Longest Common Subsequence (LCS) of X and Y is 5. O Let v be a vertex in the graph G. If v.d -oo after we run Breadth First Search algorithm BFS(G,s), then it means that v is not reachable from the source vertex s. O Let G be a directed graph. In the adjacency-list representation of G, the sum of the lengths of adjacency lists is 2E