Q1.

V = {A, B, C, D, E, F, G, H, I}

E = {e1 = (A, B), e2 = (A, C), e3 = (A, D), e4 = (B, C), e5 = (B, F), e6 = (B, H), e7 = (C, D), e8 = (C, E), e9 = (C, F), e10 = (D, E), e11 = (D, I), e12 = (E, F), e13 = (E, G), e14 = (F, G), e15 = (F, H), e16 = (G, H), e17 = (G, I), e18 = (H, I)}

W = {22, 9, 12, 35, 36, 34, 4, 33, 30, 18, 23, 24, 39, 25, 21, 19}

The weight of the shortest path from node A to I in the undirected graph is........... .

Q2.

Group code are generated using \(G = \begin{bmatrix} 1 & 0 & 0 & 1 & 1 & 0 \\ 0 & 1 & 0 & 0 & 1 & 1 \\ 0 & 0 & 1 & 1 & 0 & 1 \end{bmatrix}\) for communication. Then.......... is not code word.