John is given a sorted array with the name values$[]=\{0,1,12,24,35,46,57,68,89\}.$ How many comparison does John need to figure out if the binary search algorithm has to find the key value $=68?$

$6$

$3$

$5$

$2$