You have a sorted list of $20$ numbers and want to check whether the number $5$ is present in the list using a binary search with recursion.

How many recursive calls will you need to accomplish in the worst$-$case scena

$10$

$5$

$4$

$2$