3) For the graph below write the order in which vertices would be visited in a breadth-first search (BFS). This is an undirected graph. B AEC 4) A) For these characters and frequencies, in the table fill in the Huffman code for each character. B) Please also calculate the total number of bits that Huffman coded file would take.. C) What is the height of the binary tree that you used to find this Huffman code? character frequency A 2 B 2 C 3 D 4 E 8 Huffman Code