There are 6 jobs with distinct difficulty levels, and 3 computers with distinct processing speeds. Each job is assigned to a computer such that:

- The fastest computer gets the toughest job and the slowest computer gets the easiest job.

- Every computer gets at least one job.

The number of ways in which this can be done is ______

Consider the two statements.

S₁ : There exist random variables X and Y such that

(E[X - E(X)) (Y - E(Y))])² > Var[X] Var[Y]

S₂ : For all random variables X and Y,

Cov[X, Y] = E [|X - E[X]| |Y - E[Y]|]

Which one of the following choices is correct?

An articulation point in a connected graph is a vertex such that removing the vertex and its incident edges disconnects the graph into two or more connected components.

Let T be a DFS tree obtained by doing DFS in a connected undirected graph G. Which of the following option is/are correct?