Given an array of non-negative integers and a target k, count how many subsets have a XOR equal to k. The empty subset is included and has XOR 0.
Input: A JSON object {"nums": [<non-negative integers>], "k": <target>}.
Output: Return the number of subsets whose XOR equals k.
Input: {"nums":[6,9,4,2],"k":6}
Output: 2
Explanation: Two subsets XOR to 6.Input: {"nums":[1,1],"k":0}
Output: 2
Explanation: The empty subset and {1,1} both XOR to 0 -> 2.0 <= len(nums) <= 200 <= nums[i], k < 1024