XIII The VERTEX-COVER problem is to find a vertex cover of the size k in a given graph G. In theSUBSET-SUM problem, given a finite set

, we ask whether there isa subset

whose elements sum to t. The VERTEX-COVER problem is polynomial-timereducible to the SUBSET-SUM problem. Given an instance ＜ G,k ＞ of the VERTEX-COVERproblem, one can construct a corresponding instance ＜ S,t ＞ of the SUBSET-SUM problem. Giventhe following graph G and k = 3, {u1, u3, u4} is the vertex cover of size k = 3. The correspondingset S = [1 4, 16, 64 256, 1040, 1041, 1093, 1284, 1344) is constructed as the following table. What isthe target t?__ (20)__

(A) 2389
(B) 3417
(C) 3754
(D) 3758