Reapply the greedy algorithm we discussed today for the set covering problem with the function $F_i(f_i,k_i)=f_i-k_i$ and compare the results with what we did in class.

Consider the Maximal Covering Problem. Develop the formulation in MS Excel and solve the model using the Excel Solver add$-$in$.$ You can refer to the Excel file we developed in class $($available in Teams$).$

Consider the Set Covering Problem with Penalty Cost. Develop the formulation in MS Excel and solve the model using the Excel Solver add$-$in$.$ You can refer to the Excel file we developed in class.

a$)$ Take the $p_j$ values as they are.

b$)$ Take the $p_j$ values divided by ten.

c$)$ Take the $p_j$ values divided by a hundred.

Note: Sample problem data $($also used in class$)$ for questions $2$ and $3$ are as follows:

$t_{ij}=$

$\backslash$table$[[$tij $($in km$,1,2,3,4,5$