Complete the implementation of the function k

$\_$

tsp

$\_$

mtz

$\_$

encoding

$($

n

$,$

$$k

$,$

$$cost

$\_$

matrix

$)$

$$below using PULP. It follows the same input convention as the code supplied in the notes. The input n denotes the size of the graph with vertices labeled

$0$

$,$

$.$

$.$

$,$

$$n

$-$

$1$

$,$

$$k is the number of salespeople, and cost

$\_$

matrix is a list of lists wherein cost

$\_$

matrix

$[$

i

$]$

$[$

j

$]$

$$is the edge cost to go from i to j for i

$!$

$=$

$$j

$.$

$$Your code must avoid accessing cost

$\_$

matrix

$[$

i

$]$

$[$

i

$]$

$$to avoid bugs. These entries will be supplied as None in the test cases.