HW4 Dec/23 1. Kouting algorithms: - (1). (40%) Consider the network shown on the right. Show the operation of Dijkstra's (link state) algorithm for computing the least cost path from node A to the rest of the destinations. Show how the algorithm works by computing a table similar to Table 5.1. - (2). (60%) Consider the network shown on the right, and assume that each node initially knows the costs to each of its neighbors. Consider the distance-vector algorithm and show the distance table entries at each node step-by-step. - Due 1/10/2023 1:20PM, - to new E3