Create an AI Hill Climbing Optimization Method in Python for "The Prisoners Dilema" (a situation where two parties, separated and unable to communicate, must each choose between cooperating with the other or not. The highest reward for each party occurs when both parties choose to co-operate). Please use a population size of 100, a mutation probability of 0.01 and a crossover probability of 0.8. Thank you.