<t>Another solution is to use dynamic programming.Denote Bi as the $ of the i-th borrower, Lj as the $ of the j-th lender. Further denote f([B1, B2, ..., Bn], [L1, L2, ... Lm]) as the function evaluating the minimum number of "links" among the n borrowers and the m lenders.The recursive relationship...