Problem $3(6$ points$)$ Given a requirement matrix below on $7$ nodes, find the minimum capacity network that satisfies the entire requirements in the matrix one at a time $($the network synthesis problem$).($Use the sorting$-$peeling$-$superimposing method introduced in class. Show the full process$).$