Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to.

• A. n+1
• B. n-1
• C. +n-1
• D. +n