12. Look at the figure below and answer the questions that follow it: . 9 w S m 6 10 2 N 2 7 If node 4 failed, what would be the best route from 7 to 1? A two-way link from 1 to 5 is established. The costs for both directions are equal. Traffic traveling back and forth between nodes 1 and 7 do not use this link. What is the lowest cost that could be set on this link under these conditions?

4. Consider the network diagram given in the figure below with the indicated flow capacities along each branch. 4 2 0 5 7 8. 3 4 4 1 O 9 1 O 6 8 4 Name: Consider the network diagram given above with the indicated flow capacities along each branch. Determine the maximal flow from source node 1 to destination node 9. CO 3. CO 5 2. 2.

Look at this network fragment. w and y are x's only neighbors. W's minimum-cost path to u (not illustrated) is 5, while y's is 6. The pathways from w and y to u and between them are not indicated. All network link costs are positive integers. 2, Give x's distance vector to w, y, and u.

Assume that the flags in a TCP packet are set in the order of [ cwr | ece | urg | ack | psh | rst | syn | fin ]. Write a Scapy command to perform "FIN" scan two ports 4000 and 4050 of the destination with IP address, "121.10.3.11". You should use a hexadecimal flag.