Your task in this exercise is to find the maximum
independent set.
Select the vertices that can form a mximum independent set.
[independentSet_KA.userInput]
if (!independentSet_KA.checkAnswer() && !guess[0])
return ""; // User did not click, and correct answer is not
// initial array state
else return independentSet_KA.checkAnswer();