$12\mathrm{.}10.$ A construction company needs to assign four workers to four jobs. The accompanying

table specifies the workers' proficiency scores for the jobs. A dash $"-"$ in position

$(i,j)$ indicates that worker $i$ is unqualified to perform job $j.$ Use the successive shortest

path algorithm to identify an assignment that maximizes the total proficiency scores

for carrying out the jobs.