Welcome to Bytelearn!

Let’s check out your problem:

A balanced coin with one side heads $(H)$ and the other side tails $(T)$ is repeatedly flipped, and the results are recorded. The coefficients in the expansion of $(H+T)^{n}$ give the number of ways to get a particular combination of heads and tails for $n$ flips of the coin. For example, in the expansion of $(H+T)^{7}$, the term $21 H^{2} T^{5}$ means there are $21$ ways to get exactly $2$ heads and $5$ tails when flipping a coin $7$ times. How many ways are there to get exactly $2$ heads and $4$ tails when flipping a balanced coin $6$ times?$\newline$(A) $6$$\newline$(B) $15$$\newline$(C) $20$$\newline$(D) $48$