$[40$ pts$.]$ Four 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. Use the Hungarian method to solve the problem. Show each step and calculations clearly.

$\backslash$table$[[,$Time $($hours$)],[,$Job $1,$Job $2,$Job $3,$Job $4],[$Worker $1,4,2,5,7],[$Worker $2,8,3,10,8],[$Worker $3,12,5,4,5],[$Worker $4,6,3,7,14]]$

$x_1{?}_{?}=1,x_2=1,x_3=1,$ and $x_4=1,z=$

$q,$

Can you solve this?