The correct answer is 1120
Required number of ways = Total ways of selection – ways in which B1 and B2 are present together.
\(=^{10}C_3⋅^5C_3−^8C_1⋅^5C_3\)
=10(120−8)
= 1120
The number of strictly increasing functions \(f\) from the set \(\{1, 2, 3, 4, 5, 6\}\) to the set \(\{1, 2, 3, ...., 9\}\) such that \(f(i)>i\) for \(1 \le i \le 6\), is equal to:

Permutation is the method or the act of arranging members of a set into an order or a sequence.
Combination is the method of forming subsets by selecting data from a larger set in a way that the selection order does not matter.