Q$1)(50$ pts$)$ For the below network:

$($a$)$ formulate a linear programing problem for Maximum flow

$($b$)$ Use Ford$-$Fulkerson method to find the Maximum flow from source to sink$.$ Write down path and total flow for each path