We need to choose three distinct numbers

a, b, c from 1, 3, 5, 9, 13 such that a + b + c = 25.

For our initial state, we randomly choose state (1, 3, 5).

This notation means a = 1, b = 3, and c = 5.

The heuristic function for our search is h(a, b, c) = max(25 (a + b + c), 0) and our goal is to reduce h(a, b, c) to 0.

Please just don't give answers and explain how to solve these questions.

a. What is the value of the heuristic function h(a, b, c) for the initial configuration?

b. You can reach neighboring states by changing one number of the triplet. Ex) state (1, 3, 5) to state (1, 3, 9). What state should be the next state according to the hill-climbing(steepest-descent) algorithm? What is the heuristic value of the new state?