CLASSIC QUESTIONS

Genetic Algorithm $(40)$

$1\mathrm{.}1.$Please write a description about genetic algorithm by your own sentences.

$1\mathrm{.}2.$Then consider bellow function and perform a genetic algorithm to maximize this function according to the given information.

To perform genetic algorithm over this function, please follow bellow steps: $($You must continue the algorithm to create one or two generations and then you will talk about possible termination conditions, it means that you don't have to find the optimal solution by several iterations, just one or two iteration is enough$)$

$f(x)=2x+2$

$x$ value ranges from $0-63$

Population size $(n)=6$

$1\mathrm{.}2\mathrm{.}1.$ Encoding technique $($Pattern of individuals$)$

$1\mathrm{.}2\mathrm{.}2.$ Initial population generation

$1\mathrm{.}2\mathrm{.}3.$ Selection process

$1\mathrm{.}2\mathrm{.}4.$ Crossover operator

$1\mathrm{.}2\mathrm{.}5.$ Mutation operator

$1\mathrm{.}2\mathrm{.}6.$ And finally describe about possible termination conditions

$2.$ Considering $S$ as the starting point and $G$ as the goal point in the bellow graph, please find the optimal path and the cost of this optimal path using A$*$ algorithm? $($Please write the steps of finding solution by drawing tree and calculating the costs$)(30)$

$\backslash$table$[[$State$,h$