$2-$ Please Solve the transportation problem below by using Python $($pyomo framework and suitable solver$).$

The transportation problem

In the transportation problem, we must match suppliers I of limited capacity $b_i$ to a set of customers $J$ to meet their known demands $d_j.$ Each pair $(i,j)$ has a known supply cost $c_{ij}.$ Our goal is to minimize the total cost by defining how much of each demand is supplied by each supplier. We$,$ therefore, consider decision variables $x_{ij}$ to represent those quantities. If we consider conditions such that the total supply capacity meets total demand, we can formulate the problem as the following.

$\{\begin{array}{cc}\text{:}[min,& {\displaystyle \underset{\text{i}\text{i}\text{n}\text{I}}{\overset{?}{}}}{\displaystyle \underset{\text{j}\text{i}\text{n}\text{J}}{\overset{?}{}}}{c}_{i,j}{x}_{i,j}]\\ & s.t.,& {\displaystyle \underset{\text{j}\text{i}\text{n}\text{J}}{\overset{?}{}}}{x}_{i,j}{b}_i\\ ,& {\displaystyle \underset{\text{i}\text{i}\text{n}\text{I}}{\overset{?}{}}}{x}_{i,j}=d_j\\ ,& \text{A}\text{A}\text{i}\text{i}\text{n}\text{I}\\ ,& \text{A}\text{A}\text{j}\text{i}\text{n}& 0\end{array}$AAiinIAAjinJ

Let us consider an example with four customers $\{A,B,C,D\}$ and three suppliers $\{1,2,3\}.$ The demand of each customer is respectively $5,15,13,$ and $17.$ The capacity of each supplier is respectively $14,26,$ and $11.$ Now consider the following costs matrix.