* Home Co CSC 5 CSCI120D (Fall 2018) - Introduction to Computer Science and ProgrammingI (Python) Lab 9D Investigating the efficiency of the Binary Search algorithmm Lab 9D Investigating the efficiency of the Binary Search algorithm Return to: 5 November - 11... Using your solution to Lab 9C, write a program that counts how many steps to find the number 9467 in a list of size 20000 (using unique random numbers in the range 1 through 321000). Then double the list size to 40000 and count the steps taken to find the same number, then keep doubling the list size until the list size is 320000. For each list size, find how many steps to find the number 9467. Your program should print the list size followed by the number of steps, for each list size... NOTE: it may take several minutes for the program to complete its output. Be patient! The output should look similar to this: Length ot list: 209 Steps: 14 NOT Fuund lenath of list: 4 steps: 15 NCT Found! Length ot list: 8 Steps: 16 NCT Found I length of list: 16888 steps: 17 NOT Found Length ot list: 32 Steps: 19 KCT Found