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

def find$\_$match$($names$\_$list, lower$\_$index, upper$\_$index$)$:

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

print$($f$\text{'}$Number of elements in the range: $\{$range$\_$size$\}\text{'})$

print$($f$\text{'}$Middle index: $\{$middle$\_$index$\}\text{'})$

print$($f$\text{'}$Element at middle index: $\{$names$\_$list$[$middle$\_$index$]\}\text{'})$

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

find$\_$match$($data$\_$list, $0,$ len$($data$\_$list$)-1$