-Can you please answer this 3 problems:

Hated Sait Assignments Csci 36 l x y D Writing Assignment4 pdf X C Chegg.com x C Chegg Study IGuided Sc x C Secure I h ps:// 1/courses/Csci 361 Section 1 WANG 2016-2017 SPRG/WritingAssignment4.pdf blackboard,olemiss.edu 5 Writing Assignment4.pdf CSC1361 Writing Assignment 4 Problem 1: Consider the network on the following figure. With the indicated link costs, use Dijkstra's shortest-path algorithm to compute the shortest path from z to all network nodes. Show how the algorithm works by computing a table similar to the following. Also, provide the resulting forwarding table in z. Step 12,2 12 2.46 AM 1x ENG Type here to search A 4/23/2017