def tsp$\_$with$\_$extra$\_$constraints$($n$,$ cost$\_$matrix, constraints$)$:

assert len$($cost$\_$matrix$)==$ n$,$ f'Cost matrix is not $\{$n$\}$x$\{$n$\}\text{'}$

assert all$($len$($cj$)==$ n for cj in cost$\_$matrix$),$ f'Cost matrix is not $\{$n$\}$x$\{$n$\}\text{'}$

assert all$(1<=$ i $<$ n and $1<=$ j $<$ n and i $!=$ j for $($i$,$j$)$ in constraints$)$

# TODO: encode the problem in pulp $($a$)$ decision variables; $($b$)$ constraints; $($c$)$ objective; $($d$)$ solve and extract

# solution. This is going to be very close to the MTZ encoding that we have presented in our notes. You can use

# our code as a starting point.

# your code here

raise NotImplementedError