Using c++ Implement a Hill Climbing (descending) algorithm to find the global minimum of the Eggholders function ( , -10000

Randomly generate an initial position. Use the Hill Climbing algorithm to optimize the Eggholders function starting from the initial position. Terminate the optimization process when a better position yielding lower objective function value is not found in the last 100 steps. Repeat this process for 100 runs. Display the distribution of the minima you found in each run on a figure.

T2 + 47) sin T2 + 47) sin