Issue with Problem 17 in chapter 8

[AllenAnZifeng]

In the provided solution, it is assumed that the last element -- the nth element is guaranteed to be in the chosen subset, which is not necessarily correct. The reason is that only the last node is connected to the first node with a negative weight of W. The correction I am proposing is that every node in the constructed graph should have a direct path with weight negative W pointing back to the first node -- the 0th node.