Greedy Method

Consider a Job scheduling problem with deadlines.

If Y is the minimum value such that Job 6 gets scheduled and X is the maximum value possible so that Job 4 will never get scheduled, then the value of 2^X+Y is ____

Which of the following is true?

Which of the following statement(s) is/are correct regarding the Prims and Kruskal algorithm?

Which one of the following statements is correct regarding the Bellman-Ford short test path algorithm?

P: Always find a negative weight cycle if one exists.

Q: Find whether any negative edge weight cycles are reachable from the source.

Consider the following graph:

The number of strong components of the above graph is ____.