C. Given the following network graph in Figure Q4(b), formulate the nearest distance between any 2 nodes using Bellman-Ford algorithm. [Hint: you only need 2 hops] (CO3:PO3- 10 Marks) A 2 1 B 5 F 1 6 D E 5 Figure Q4(b) QUESTION 4 (25 Marks) You are a network consultant from a vendor that is hired by 3 different companies to fine tune their networks. When you checked the IP address in one of the PCs in each of the companies, you found the following IP addresses: Company 1:52.158.99.167 Company 2 : 196.104.59.165 Company 3 : 180.186.235.183 . i. Analyze the network class for each of the companies. If the companies decided to have 4 subnets in each of their systems, evaluate the appropriate subnet masks for them. (CO2:PO2- 6 Marks) b. You are given the following 100 characters of 5 different characters to be sent over the intemet. You are required to compress them using Huffman coding. i. Solve the Huffman code for the characters, and ii. Analyze the compressed size and explain how the Huffman coding can reduce the cost of data transmission. (CO2:P02- 9 Marks) SSSYS S Y Y SS SS SSYS S SS S SQSSSQS SY SHS QSS Q Q S S Y HS SY BSSYS S S S S SYS S SS S S SYSSSSYS SHS YSS Q BQ YS S SS YBS SY Y Y SSSYYS SQSS