Use your ability to compute combinations and permutations to calculate number of possible schedules.
[1 point] Using the above graph, take all possible paths from the root (node A) to at least one other node to be the sample space. What is that sample space? An example of on path would be ACF.
[1 point] Assume the probability of all paths to be equal. What is the probability of one of the paths?
[2 points] Take a random variable $L$ to be the length (number of nodes) of the paths. What is $P(L = 3)$?
[2 points] Take the random variable $C$ to be $1$ when a path contains node C and $0$ otherwise. What is $P(C = 1)$?
[2 points] What is $P(C = 1, L = 3)$?
[2 points] What about $P(C = 1 \, | \, L = 3)$?
[5 points] Write out all possible paths with $L = 3$ and mark as bold those which have $C = 1$. Use this as justification for your answer to 3.6.
[3 points] Are random variables C and L independent?
[3 points] Define a third random variable, D, to indicate if node D is in the path. Are D and C conditionally independent of L?