Number of ways to choose 2 distinct positions for L’s from positions \( \geq n \), and \( n \leq 5 \), so from n, n+1, ..., 5, which has size \( 5 - n + 1 \), and we choose 2: \(\binom6 - n2\), provided \( 6 - n \geq 2 \), i.e., \( n \leq 4 \) - Abu Waleed Tea