Q.No.5. 50 3 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: 4 100 5 60 lle.g. bilal ahmed19-arid-1234 string=your fullName 19-arid-yourNo" l/consider & use space after each word Now draw a Huffman tree and generate codes