See the network shown below (*) with four routers A, B, C, and D connecting the networks X and Y. Apply Distance Vector routing protocol and show how these routers will find a path between the networks X and Y. For each iteration, (a) First, write the route table messages exchanged between each pair of routers [Like, From A to B, From A to C, From B to A, From B to C, From C to A, From C to B, From C to D, From D to C] (b) Then, write the route table entries of each router [A, B, C, & D] at end of the iteration (*) Reference: Mike Meyers' CompTIA A+ Guide to Managing and Troubleshooting Networks, Fifth Edition (Exam N10-007) Network ID X Metric: 2 Metric: I Metric: I B C Metric: 10 Network IDY D You may read the slides from 56 to 61 and the corresponding material in the textbook to complete this assignment. If you like, you may use pen and paper to write your answer and take a picture of it, paste it in a word file, and submit it for grading. Note that the picture should be clear and properly visible for grading. Your answer should have the following format: Initially Router A has a route table entry for Network X and Router B has a route table entry for Network Y Complete the following iterations until the steady state is reached. Iteration: 1 a) Route Table Message from A to B Ans: b) Route Table Message from A to C Ans: c) Route Table Message from B to A Ans: d) Route Table Message from B to C Ans: e) Route Table Message from C to A Ans: f) Route Table Message from C to B Ans: g) Route Table Message from C to D Ans: h) Route Table Message from D to C Ans: Final route table entry of each router at the end of iteration 1 Router A has the following entries Ans: Router B has the following entries Ans: Router C has the following entries Ans: Router D has the following entries Ans: