While solving an LPP (defined by n variables and m equations, m < n) through simplex method, basic solutions are determined by setting n – m variables equal to zero and solving m equations to obtain solution for remaining m variables, provided the resulting solutions are unique. This means that the maximum number of basic solutions is:

• A. \(\frac{{n!}}{{m!\left( {n - m} \right)!}}\)
• B. \(\frac{{m!}}{{n!\left( {n - m} \right)!}}\)
• C. \(\frac{{n!}}{{m!\left( {n + m} \right)!}}\)
• D. \(\frac{{m!}}{{n!\left( {n + m} \right)!}}\)