50 3 a) Find the shortest path from source node 1 to every other node using suitable Graph Algorithm 2 10 10 30 20 b) Write the following string with your 100 information: 5 4 60 string="Moead Rehan...

Course Title: Data Structures and Algorithms


Question

Extracted text: 50 3 a) Find the shortest path from source node 1 to every other node using suitable Graph Algorithm 2 10 10 30 20 b) Write the following string with your 100 information: 5 4 60 string="Moead Rehan 19-arid-814" Ilconsider & use space D after each word Now draw a Huffman tree and generate codes.