Consider the following variant of a bingo board: $365971355645967331$ You are given $10$ chips to place on $10$ cells on the above board. However, you cannot place more than two chips in the same row or more than two chips in the same column. Your score is the sum of values written on cells on which you place your chips. Our objective is to find the optimal placement of chips that maximizes your total score. Let c denote the value on the cell in row i and column j$.$ The mathematical model of the above problem is: max s$.$t$.$cij $*$ xij $=16$xij $<=2,$ for i $=1,...,6$ and j $=1,...,8$ where xij is a binary decision variable. xij $=1$ indicates that we have placed a chip on the cell in row i and column j$,$ and xij $=0$ indicates otherwise. Download q$02.$py in the Final Exam Question $2$ assignment link. In this file, the values of the above bingo board are already coded in the form of a nested list where inner lists represent rows of the table. Use the GurobiPy package and write a Python program that finds and prints the optimal solution for the above problem. Your complete script file should be renamed as yourname$-$q$02.$py and must be submitted to the assignment "Final Exam Question $2".$