Q$\mathrm{.}5.$ In a Genetic Algorithm you would like to design the mutation operation in a manner that, among the

candidate solutions after many generations of evolution, the "good" candidates will see only mild changes

in their values $($i$.$e$.$ they search their immediate neighborhoods$)$ while the "bad" solutions will search

regions that are far apart in the domain of feasible solutions. How will implement this $?$

$[10$ Marks$]$