$3\mathrm{.}2\mathrm{.}1$: Recursive algorithm: Search.

Alphabetically sorted strings are read from input into a list. Complete the find$()$ function, which outputs range$\_$size, middle$\_$index, and the element at middle$\_$index:

Assign range$\_$size with the total number of list elements from lower$\_$index to upper$\_$index $($both inclusive$).$

Assign middle$\_$index with the result of dividing the sum of lower$\_$index and upper$\_$index by $2$ using floor division $(//).$

Click here for example

Ex: If the input is dim jog leg, then the output is:

Number of elements in the range: $3$