Consider the balanced transportation problem with three sources \( S_1, S_2, S_3 \), and four destinations \( D_1, D_2, D_3, D_4 \), for minimizing the total transportation cost whose cost matrix is as follows:

where \( \alpha, \lambda>0 \). If the associated cost to the starting basic feasible solution obtained by using the North-West corner rule is 290, then which of the following is/are correct?
P and Q play chess frequently against each other. Of these matches, P has won 80% of the matches, drawn 15% of the matches, and lost 5% of the matches.
If they play 3 more matches, what is the probability of P winning exactly 2 of these 3 matches?