The number of shortest paths from $HOSTEL$ to $ALLEN$ is equal to (as shown in the given figure):

In how many ways can $5$ boys and $3$ girls sit in a row so that no two girls are together?

Let $P$ be a closed polygon with $10$ sides and $10$ vertices (assume that the sides do not intersect except at the vertices). Let $k$ be the number of interior angles of $P$ that are greater than $180^{\circ}$. The maximum possible value of $k$ is

There are $5$ points $P_1, P_2, P_3, P_4, P_5$ on the side $AB$,excluding $A$ and $B$,of a triangle $ABC$. Similarly,there are $6$ points $P_6, P_7, \ldots, P_{11}$ on the side $BC$ and $7$ points $P_{12}, P_{13}, \ldots, P_{18}$ on the side $CA$ of the triangle. The number of triangles that can be formed using the points $P_1, P_2, \ldots, P_{18}$ as vertices is:

Two women and some men participated in a chess tournament in which every participant played two games with each of the other participants. If the number of games that the men played between themselves exceeds the number of games that the men played with the women by $66$,then the number of men who participated in the tournament lies in the interval

There are $6$ points on a circle. Two triangles are drawn such that they have no common vertices. What is the probability that none of the sides of the triangles intersect?