The Mercer kernel for a polynomial learning machine used to solve the XOR problem is defined by
![254_559dd4dc-2055-4c45-ba8a-13c4b9affa50.png](https://secure.tutorsglobe.com/CMSImages/254_559dd4dc-2055-4c45-ba8a-13c4b9affa50.png)
What is the minimum value of power p for which the XOR problem is solved? Assume that p is a positive integer. What is the result of using a value for p larger than the minimum?