Consider the search space discretisation strategy employed for the local search algorithm. How many neighbours would a solution of a $6-$dimensional problem have?

Question $3$Answer

a$.$

$1200$

b$.$

$3$

c$.$

$24$

d$.$

$12$

e$.$

$6$