Q$1.$ Five workers are available to perform four jobs. The time it takes each worker to perform each job is given in the following table. The goal is to assign workers to jobs so as to minimize the total time required to perform the four jobs.

a$.$ Determine the optimal assignment$($s$)$ that will minimize the total reqired time.

b$.$ Formulate the problem as a linear programming model.

$\backslash$table$[[,$Time $($Hours$)],[$Worker$,$Job $1,$Job $2,$Job $3,$Job $4],[1,10,15,10,15],[2,12,8,20,16],[3,12,9,12,18],[4,6,12,15,18],[5,16,12,8,12]]$