Please show all code needed to get answer IN PYTHON

Let J be a set of jobs that need to be processed on a single machine. Let p and d be the processing time and due date of job j in J. Assume the following inputs: -0, 1, 2, 3. 4, 5 P [10, 3, 4, 8, 10, 6] d-[15, 6, 9, 23, 20, 30F due dates jobs (index) processing times Problem 5-20 points Load in memory the lists j, p and d described in the first part of the assignment. Write a Python statement (i.e. a single line of Python code) that prints the index of the job with the longest processing time