@The-Blade-Dancer For the mini-question, you are right, the wording is a bit difficult to understand here. It's really asking, "Count the ways to color the top six nodes. Now count the ways to have the lower two nodes (with arrows) the same color. Divide the \(2^{\text{nd}}\) number by the \(1^{\text{st}}\) number. What fraction do you get?"

Another way to state this question is, "Suppose you want the lower two nodes, with arrows pointing on them, to be the same color. What is the probability that out of all possible colorings of this graph, you get what you want?"