its a homework about divide and conquer

5. Describe how linear search can be implemented recursively. (To keep things simple, this implementation should return True if the target is found and False otherwise.) Then, specify the recurrence of the worst-case time complexity. Can you use the master method to conclude that this recursive implementation of linear search runs in en) time in the worst case? Justify your