Given the sorted list below and using the pseudocode for the Binary Search, explain how the Binary Search works when searching for the given SearchID below.

How many comparisons are made before the Search Item $90$ is found or not found? $q,$

$1,10$

$2,15$

$320$

$4,26$

$5,29$

$6,35$

$7,44$

$8,50$

$960$

$10,70$

$1180$

$1290$

$13,99$