Programming Problem: Create a module called bigo which has four functions, find1(list, val), find2(list, val), find3(list, val), and find4(list, val). Each of the functions will take as arguments a list followed by a value. The functions will return a boolean as to whether the val is a member of the list. The specification for each of the functions is as follows: findl(list, val): The unsorted list is searched linearly to see if the val is in the list find2(list, val): A deep copy is made of the list; the copied list is then sorted using the sort built- in function and then a binary search is performed on the list to find if the val is in the list find3(list, val): The in built-in is used to determine if the val is in the unsorted list find4(list, val): This function requires the list to be sorted before it is called. A binary search is performed on the pre-sorted list to find val. Code the four functions in module as described above. Write a report which: 1) Determines the Bigo complexity for each function 2) Graphically depicts the running time of each of the functions as the size of the list increases. Do this using the Timer in the python Timelt module. Note: the graphs do not need to be generated programmatically; you can just graph these collecting the data and using something like excel.
