Please answer these codes for a computer science class using idle. Use great detail and label clearly. Make sure you do not leave out any code. Thank you I'm new to this I need all the help I can get.

Info We have learned this week, that a linear search (also known as sequential search) is not as effident as a binary seand when we are searching a sorted For Homework 5. You wrote a to the fie for a year to the location of the summer olympias for that year. We nowknow that since datafie "assorted byye a binary seand would have been much more efficient. 1. Download the solution for Homework 5 from the attachment below and do the following with the codec a Add a new function to the program that performs a binary search to find the location of the olympics in the given year You can start with the following skeleton: def findiocationbinary (yearList, loctist, year): Frill in the code to find the year in the year list and return the associated location from the location 11st using Binary search You can find the code for binary search on the Sample Code page of the Saka web ste. It wil need to be modned slightly to ft this problem. You can find the olympics txt fie here: b. Insert a counter in the of each of the two findLocation functions to count the important comparison instructions. At the end of the function, print the number of comparisons made do the search. Modify the main function of the code so that itcals BOTH findLocator functons. d In the comments the prigram, include a discussion about the worst case input for each of the two agorithms along with a description of a comparison of the performance of the two algorithms. When does linear search perform better than binary search? Your output will look something like this: Python 3.5.2 Cv3.5.2:4defza29elas, Jun 26 2016, 18:47:25) [Gcc 4.2.1 (Apple Inc. build 5666) (dot 3)] on darwin Type "copyright "credits or "licensex)" for more information RESTART: Ausers/idi pippa/Documents/csc 11a/homework/hw- solutions-fot12 e16hw 6-1 onolysis.py maino Please the name of the date file: olympics.txt Enter the year you are interested in: 2006 Info We have learned this week, that a linear search (also known as sequential search) is not as effident as a binary seand when we are searching a sorted For Homework 5. You wrote a to the fie for a year to the location of the summer olympias for that year. We nowknow that since datafie "assorted byye a binary seand would have been much more efficient. 1. Download the solution for Homework 5 from the attachment below and do the following with the codec a Add a new function to the program that performs a binary search to find the location of the olympics in the given year You can start with the following skeleton: def findiocationbinary (yearList, loctist, year): Frill in the code to find the year in the year list and return the associated location from the location 11st using Binary search You can find the code for binary search on the Sample Code page of the Saka web ste. It wil need to be modned slightly to ft this problem. You can find the olympics txt fie here: b. Insert a counter in the of each of the two findLocation functions to count the important comparison instructions. At the end of the function, print the number of comparisons made do the search. Modify the main function of the code so that itcals BOTH findLocator functons. d In the comments the prigram, include a discussion about the worst case input for each of the two agorithms along with a description of a comparison of the performance of the two algorithms. When does linear search perform better than binary search? Your output will look something like this: Python 3.5.2 Cv3.5.2:4defza29elas, Jun 26 2016, 18:47:25) [Gcc 4.2.1 (Apple Inc. build 5666) (dot 3)] on darwin Type "copyright "credits or "licensex)" for more information RESTART: Ausers/idi pippa/Documents/csc 11a/homework/hw- solutions-fot12 e16hw 6-1 onolysis.py maino Please the name of the date file: olympics.txt Enter the year you are interested in: 2006