Q$.5($a$)$ Table below shows a population of four strings. Assuming that the string represents a binary encoding of a number $\text{'}n\text{'},$ and that the fitness function is given by $F_i=\frac{100}{n},$ fill in the rest of the tables

$\backslash$table$[[\backslash$table$[[$String$],[$No$.]],$String,n$,$F$\_($i$),($F$\_($i$))/(\backslash$sum F$\_($i$)),\backslash$table$[[$No$.],[$Surviving$]],\backslash$table$[[$Mating$],[$Pool$]]],[1,10111,23,,,,],[2,00111,7,,,,],[3,01001,9,,,,],[4,01010,10,,,,]]$

$\backslash$table$[[\backslash$table$[[$Mating$],[$Pool$]],$Mate,$\backslash$table$[[$Crossover$],[$point$]],\backslash$table$[[$New$],[$Population$]],$n$,$New F$\_($i$)],[,,,,,],[,,,,,],[,,,,,],[,,,,,]]$