code: from __future__ import annotations
  def 		snake_case__  (		lowercase				):
     lowerCAmelCase_:       str         =  [0] * len(lowercase				)
     for i in range(1       ,							len(lowercase				)				):
        lowerCAmelCase_:       List[str]         =  duration_times[i - 1] + waiting_times[i - 1]
     return waiting_times
  def 		snake_case__  (		lowercase       ,							lowercase				):
     return [
         duration_time + waiting_times[i]
         for i, duration_time in enumerate(lowercase				)
     ]
  def 		snake_case__  (		lowercase				):
     return sum(lowercase				) / len(lowercase				)
  def 		snake_case__  (		lowercase				):
     return sum(lowercase				) / len(lowercase				)
  
  
  if __name__ == "__main__":
   # process id's
   a     :			Any					    =						[1, 2, 3]
  
   # ensure that we actually have processes
   if len(processes) == 0:
    print("""Zero amount of processes""")
    raise SystemExit(0)
  
   # duration time of all processes
   a     :			Any					    =						[1_9, 8, 9]
  
   # ensure we can match each id to a duration time
   if len(duration_times) != len(processes):
    print("""Unable to match all id's with their duration time""")
    raise SystemExit(0)
  
   # get the waiting times and the turnaround times
   a     :			str					    =						calculate_waiting_times(duration_times)
   a     :			List[str]					    =						calculate_turnaround_times(duration_times, waiting_times)
  
   # get the average times
   a     :			str					    =						calculate_average_waiting_time(waiting_times)
   a     :			str					    =						calculate_average_turnaround_time(turnaround_times)
  
   # print all the results
   print("""Process ID\tDuration Time\tWaiting Time\tTurnaround Time""")
   for i, process in enumerate(processes):
    print(
        f'''{process}\t\t{duration_times[i]}\t\t{waiting_times[i]}\t\t'''
        f'''{turnaround_times[i]}'''
    )
   print(f'''Average waiting time = {average_waiting_time}''')
   print(f'''Average turn around time = {average_turnaround_time}''')
style_context: def 		snake_case__  (		lowercase = 998001				):
  
     # fetches the next number
     for number in range(n - 1       ,							9999       ,							-1				):
        lowerCAmelCase_:       str         =  str(lowercase				)
  
        # checks whether 'str_number' is a palindrome.
        if str_number == str_number[::-1]:
           lowerCAmelCase_:       List[str]         =  999
  
           # if 'number' is a product of two 3-digit numbers
           # then number is the answer otherwise fetch next number.
           while divisor != 99:
              if (number % divisor == 0) and (len(str(number // divisor				)				) == 3.0):
                 return number
              divisor -= 1
     raise ValueError("That number is larger than our acceptable range."				)
  
  
  if __name__ == "__main__":
   print(f'''{solution() = }''')