II-1. (21 pts) Consider the following graph: (a-9 pts) Show the operation of Dijkstra's (Link State) algorithm for computing the least cost path from C to all destinations. How does C set its forwarding table entries for all destinations if the traditional destination-based forwarding is used? (b - 4 pts) Suppose that we use Software Defined Networking (SDN) approach (Openflow) and we want all the packets send from A to D sent over path A-C-D. How should we set match and action fields in nodes A and C ? (c-3 pts) Suppose that Distance Vector Routing is used and all the distance vectors are converged. What happens when link (E,A) is broken