There are n tasks T $=\{$t$1,$ t$2,...,$ tn$\}$ which need to be scheduled on m servers

S $=\{$s$1,$ s$2,...,$ sm$\}.$ Each task ti can only be scheduled on a subset of the servers Si $$ S$.$ Further, each

server sj has a capacity and can handle at most cj tasks where cj is a positive integer.

$($a$)(14$ points$)$ Please describe in English how you will construct an instance of Network Flow to determine

if there is a way to execute all n tasks using the available m servers.

$($b$)(6$ points$)$ How will you use the solution from your instance in $($a$)$ to determine if there is a way to

execute all n tasks using the available m servers?