$3\mathrm{.}2\mathrm{.}1$: Recursive algorithm: search. String query$\_$item and a list of alphabetically sorted strings are read from input. Complete the search$()$ function:

If query$\_$item is found at index mid$\_$index of the list, output query$\_$item, followed by $\text{'}$ is found at index $\text{'}$ and the value of mid$\_$index.

Else if range$\_$size is $1,$ output query$\_$item, followed by $\text{'}$ is not in the list'.

Otherwise, output query$\_$item, followed by $\text{'}$ is not found at index $\text{'}$ and the value of mid$\_$index.

def search$($all$\_$names, query$\_$item, min$\_$index, max$\_$index$)$:

range$\_$size $=($max$\_$index $-$ min$\_$index$)+1$

mid$\_$index $=($min$\_$index $+$ max$\_$index$)//2$

$\text{'}\text{'}\text{'}$ Your code goes here $\text{'}\text{'}\text{'}$

query$\_$item $=$ input$()$

data$\_$list $=$ input$().$split$()$

search$($data$\_$list, query$\_$item, $0,$ len$($data$\_$list$)-1)$