SOLVE IN PYTHON3 There is a busy intersection between two one-way streets: Main Street and 1st Avenue. Carspassing through the intersection can only pass through one at a time. When multiple cars arriveat the intersection at the same time, two queues can build up -- one for each street. Cars areadded to the queue in the order at which they arrive. Unfortunately, there is no traffic light tohelp control traffic when multiple cars arrive at the same time. So, the local residents havedevised their own system for determining which car has priority to pass through theintersection:• If in the previous second, no car passed through the intersection, then the first car in the queue for1st Avenue goes first.• If in the previous second, a car passed through the intersection on 1st Avenue, then the first car inthe queue for 1st Avenue goes first.• If in the previous second, a car passed through the intersection on Main Street, then the first car inthe queue for Main Street goest first.Passing through the intersection takes 1 second.For each car, find the time when they will pass through the intersection.Function DescriptionComplete the function getResult in the editor below.getResult has the following parameters:int arrival[n]: an array of n integers where the value at index / is the time in seconds when theth car arrives at the intersection. If arrival[i] = arrival[j] and i if _name__ == main : -Test ResultsCustom InputRun CodeRun TestsLine: 10 Col: 1Submit Input Format For Custom TestingSample Case 0Sample Input For Custom TestingSTDIN Function4e04011eNOH+Sample Output21arrival [] size n = 4arrival = [0, 0, 1, 4]4street[] size n = 4street = [0, 1, 1, 0]ExplanationAt time 0, cars 0 and 7 want to pass through the intersection. Car O is traveling on Main Streetand car 1 is traveling on 1st Avenue. Because there was no car passing through theintersection on the previous second, car 1 has priority.At time 1, cars 0 and 2 want to pass through the intersection. Car 2 is traveling on 1st Avenueand at the previous second a car passed through on 1st Avenue, so the car 2 passes throughthe intersection.At time 2, car 0 passes through the intersection.At time 4, car 3 passes through the intersection.Sample Case 1⠀⠀⠀⠀⠀⠀⠀⠀

Solution-According to above question an java code is created that prints the same output with taking…

through the intersection can only pass through one at a time. When multiple cars arrive tersection at the same time, two queues can build up-one for each street. Cars are the queue in the order at which they arrive. Unfortunately, there is no traffic light to trol traffic when multiple cars arrive at the same time. So, the local residents have their own system for determining which car has priority to pass through the on: the previous second, no car passed through the intersection, then the first car in the queue for wenue goes first he previous second, a car passed through the intersection on 1st Avenue, then the first car in queue for 1st Avenue goes first he previous second, a car passed through the intersection on Main Street, then the first carin ueue for Main Street goest first through the intersection takes 7 second. car, find the time when they will pass through the intersection. Description e the function geoResult in the editor below. has the following parameters: 15 16 17 18 19 21 . The function accepts following parameters: 1. INTEGER ARRAY arrival 2. INTEGER ARRAY street def getResult(arrival, street): 23 24 25 > (f