$7.$ Write a function called insertSorted that has two input parameters: a sorted list and a value to put into that list. It must put that value into the list in a sorted order. The simplest way to do this is to search the list for the place it should go$,$ then insert it$.$ That method is $\backslash ($ O$($n$)\backslash ).$ That is because it is $\backslash ($ O$($n$)\backslash )$ to find the place it should go in the list and also $\backslash (\backslash$mathrm$\{$O$\}(\backslash$mathrm$\{$n$\})\backslash )$ to insert it because the list values must be shifted to make room for the

new value. Find a way to use recursion to make this an $\backslash (\backslash$mathrm$\{$O$\}(\backslash$log $\backslash$mathrm$\{$n$\})\backslash )$ operation for finding the place for it to go but still $\backslash (\backslash$mathrm$\{$O$\}(\backslash$mathrm$\{$n$\})\backslash )$ for inserting it$.$ Write code to test your function. $[2\mathrm{.}75$ hour challenge$]$