Assume that you are required to minimize the Ackley function benchmark below for n

$=$

$4$

using

$1$

$6$

$-$

bit binary string representation. The bound for the variables is

$[$

$-$

$2$

$,$

$2$

$]$

$.$

Write the objective values for the following strings:

a

$)$

$1$

$0$

$1$

$1$

$1$

$1$

$0$

$0$

$1$

$0$

$1$

$1$

$0$

$0$

$1$

$0$

b

$)$

$0$

$0$

$1$

$1$

$1$

$1$

$0$

$0$

$1$

$0$

$1$

$1$

$0$

$0$

$1$

$0$

c

$)$

$1$

$1$

$1$

$1$

$1$

$1$

$0$

$1$

$1$

$0$

$0$

$1$

$0$

$0$

$1$

$1$

d

$)$

$0$

$0$

$0$

$0$

$0$

$0$

$0$

$0$

$0$

$0$

$0$

$0$

$0$

$0$

$0$

$1$