you give array integer num represent number write chalkboardalice Bob turn erase exactly number chalkboard Alice start if erase number cause bitwise XOR element chalkboard 0 player lose the bitwise XOR element element bitwise XOR element 0also player start turn bitwise XOR element chalkboard equal 0 player winsReturn true Alice win game assume player play optimally Example 1input num 112output falseexplanation Alice choice erase 1 erase 2 if erase 1 num array 1 2 the bitwise XOR element chalkboard 1 xor 2 3 now Bob remove element want Alice erase element lose if Alice erase 2 num 1 1 the bitwise XOR element chalkboard 1 xor 1 0 Alice loseExample 2input num 01output trueexample 3input num 123output true Constraints1 numslength 10000 numsi 216