Without using the binary search algorithm, how would you go about finding the value of 10 in an arbitrary sequence, S = [6, 2, 5, 7, 9, 12, 1, 10, 8, 4]? - Generate a Python function that would search for any target value in S and return its location or return None if the value isn't found. - What's the time complexity of this operation?

Write a version of the sequential search algorithm that can be used to search a sorted list. Write a program to test the sequential search algorithm. Use either the function bubbleSort or insertionSort to sort the list before the search. Your program should prompt the user to enter 10 digits and then prompt the user to enter a digit to search - if the list contains this digit, output its position to the console: x is found at position y If the digit is not contained in the list, output the following: x is not in the list