in Python Question 7 answer

Create a function called searcher that will return True if the integer x exists inside of the list 1 st, and false if it does not. For this problem you cannot use the membership operator in and must solve this using a for-toop. Example 1 Input: Ist =[5,4,2,10],x=10 Output: True Reasion: 10 exists inside of ' ist' Example 2 Input: 1st ={5,4,2,10},x=3 Output: False Beasion: 3 does not exist Inside of "1st' This tests your understanding of: - Variable Assignment - Loops - Conditionals - Functions [.] def search(1st, x) : pass I I = this should return "True" print (search([5,4,2,10],10)) Q/ Linear Search Complexity What is the time-complexity of the function search that you've created above? Uncomment the line of code that describes the correct big.O for time complexity. This testo your understanding of: - Big-0 Notation [1=print("o(1))=print("o(n))=print(oon+2))*print("o(n-n3))