The reduced cost, as the amount by which the value of the objective function will decrease if we increase a variable by 1unit, is 0 for all variables according to the figure above. That is logical since the reduced cost is always 0 if the optimal value is positive, and that is the case in our project. The lower bound and upper bound are set to infinity for there were no restrictions on that initially in the formulation. Other than that, the largest and lowest bound values at which our optimal solution would remain optimal are equal to our optimal values.
The output of the third line of the code was the below: