b 1 2 5 5 1 2, (15%) The network topology is shown in the right- hand side. Please use Dijkstra's algorithm to find the shortest path tree starting from node f. (a) fill out the following table to show the process of Dijkstra's algorithm (b) Draw the shortest path tree. 1 a 5 d 2 2 e P.S.: 1. The numbers aside the links mean the costs of the links 2. D(b) denotes the lowest cost for the path from fto b at this step- N' D(a),p(a) D(b),p(b) D(c)(c) D(d),p(d) Dep(e) D(f),p(f)