Consider the same setup as question $6,$ we apply the hill climbing algorithm to minimise the objective function. The hill climbing algorithm stops when the objective function becomes $0$ i$.$e$.$ no two queens attack each other. To break ties b$/$w two neighbours with the same objective function pick the neighbour obtained by moving the queen in the lower column number $($a $<$ b $<$ c $<$ d$)$ and if a tie still exists pick the neighbour obtained by moving the queen downward. The number of steps required by the hill climbing algorithm is: