Solve using formulationProblem $3.[20$ points$]$

Suppose you have three jobs that must be processed with the following characteristics $($all times

in hours$)$:

Each job can be processed on any of two identical machines; to be finished, a job must be pro$-$

cessed for its entire processing time, but this processing time can be interrupted and even moved

to a different machine if necessary. For example, we could process job $2$ from hour $1$ to $2$ on

machine $1,$ then pause it$,$ then resume processing at time $3$ on machine $2$ However, we can't

process the same job simultaneously on two machines.

$(15$ points$)$ Formulate the problem as a linear program using a maximum flow network rep$-$

resentation. Make sure to clearly define your node and arc sets, decision variables, objective

function and constraints.

$(5$ points$)$ Given your formulation from part $(1),$ what is the maximum possible flow in this

network?