CAT (QA) PYQs

How many four digit numbers, which are divisible by $6$, can be formed using the digits $0, 2, 3, 4, 6$, such that no digit is used more than once and $0$ does not occur in the left-most position?

P, Q, R and S are four towns. One can travel between P and Q along 3 direct paths, between Q and S along 4 direct paths, and between P and R along 4 direct paths. There is no direct path between P and S, while there are few direct paths between Q and R, and between R and S. One can travel from P to S either via Q, or via R, or via Q followed by R, respectively, in exactly 62 possible ways. One can also travel from Q to R either directly, or via P, or via S, in exactly 27 possible ways. Then, the number of direct paths between Q and R is

The number of ways of distributing $15$ identical balloons, $6$ identical pencils and $3$ identical erasers among $3$ children, such that each child gets at least four balloons and one pencil, is