Please fill in the gaps within the given code. They are marked by $???$and commented with # task $1$and # task $2.$

The following code shall perform a binary search.

The complexity shall not exceed O$($log n$).$

The goal is to find the position in the ascending sorted array where the element x can be found, if it is included.