Task $1$

Given the following network:

Here the numbers on the edges denote the number of parallel connected cables for each connection where single cable has capacity of $1$ Gbps$.$ The server $Q$ transfers data to the server $E$ via given routing table.

a$)$ Assume that there is no bottleck between routers $(2-5),$ what is the potential maximum data rate that servers $Q$ and $E$ would support?

b$)$ Determine the actual maximum data rate that Server $Q$ can achieve when sending data to Server E over the routing network. Use the Ford$-$Fulkerson algorithm for this.

c$)$ Determine the associated residual graph and remove the irrelevant edges.