Graph Coloring · Challenge problem

The path $P_4$ (vertices $1,2,3,4$ with edges $12,23,34$) has $\chi(P_4)=2$. Running the greedy algorithm in a RANDOM one of its $4! = 24$ possible vertex orders, what is the probability it uses exactly the optimal $2$ colors (as a reduced fraction)?