a. 50 2 10 10 a) Find the shortest path from source node 1 to every other node using suitable Graph Algorithm (3 marks) 30 20 b) Write the following string with your information: 100 5 60 l/e.g. bilal Dahmedo 19-arid-1234 string="Bilal Rasool 19-arid-890" Il consider & use space after each word Now draw a Huffman tree and generate codes