Using Fig 2 to draw the sink tree rooted at node F (take the associated weights of the links into account for this problem). AQ 4 5 B 2 E 8 6 LL F 3 7 D

(a) Find the Hamming distance between the codewords that correspond to datawords 0111 and 1100. (b)  Suppose the Hamming distance you found in part (a) is the minimum Hamming distance between all pairs in the codebook. What does this tell us about the number of errors this code can detect?

Consider the following graph. Start from vertex x, use the Depth First Search (DFS) algorithm (described in the textbook) to compute the DFS tree(s). Show intermediate results similar to the textbook example and show the final DFS tree(s). It is assumed that in the adjacency list representation, all vertices are stored according to their alphabetical order. In other words, a vertex’s neighbors should be explored by their relative alphabetical order.

Please a personal solution, not from the internet, correct and clearAlgorithms