



from __future__ import annotations

from statistics import mean






def 			UpperCAmelCase__     (     lowercase__ )			->   list[int]:
						__lowercase											=					2
						__lowercase											=					list(lowercase__ )
						__lowercase											=					[0] * len(lowercase__ )
						__lowercase											=					0
						while True:
												__lowercase											=					True
												for i, burst_time in enumerate(lowercase__ ):
																		if rem_burst_times[i] > 0:
																								__lowercase											=					False
																								if rem_burst_times[i] > quantum:
																														t += quantum
																														rem_burst_times[i] -= quantum
																								else:
																														t += rem_burst_times[i]
																														__lowercase											=					t - burst_time
																														__lowercase											=					0
												if done is True:
																		return waiting_times






def 			UpperCAmelCase__     (     lowercase__    ,							lowercase__ )			->   list[int]:
						return [burst + waiting for burst, waiting in zip(lowercase__    ,							lowercase__ )]


if __name__ == "__main__":
			UpperCamelCase__			=    [3, 5, 7]
			UpperCamelCase__			=    calculate_waiting_times(burst_times)
			UpperCamelCase__			=    calculate_turn_around_times(burst_times, waiting_times)
			print("Process ID \tBurst Time \tWaiting Time \tTurnaround Time")
			for i, burst_time in enumerate(burst_times):
						print(
						    F"""  {i + 1}\t\t  {burst_time}\t\t  {waiting_times[i]}\t\t  """
						    F"""{turn_around_times[i]}"""
						)
			print(F"""\nAverage waiting time = {mean(waiting_times):.5f}""")
			print(F"""Average turn around time = {mean(turn_around_times):.5f}""")










from __future__ import annotations

from typing import Generic, TypeVar

UpperCamelCase__			=    TypeVar("T")
class       _lowerCAmelCase (			Generic[T]      ):






			"""simple docstring"""





			def __init__(					self						:							int      ,  lowercase						:							T )    ->       Union[str, Any]:
									"""simple docstring"""







									__lowercase											=					data  # Assign data
									__lowercase											=					None  # Initialize next as null
									__lowercase											=					None  # Initialize prev as null





class       _lowerCAmelCase (			Generic[T]      ):






			"""simple docstring"""





			def __init__(					self						:							Any )    ->       None:
									"""simple docstring"""







									__lowercase											=					None





			def 		snake_case__      (					self						:							str      ,  lowercase						:							T )    ->       None:
									"""simple docstring"""







									if self.head is None:
															__lowercase											=					Node(lowercase )
									else:
															__lowercase											=					Node(lowercase )
															__lowercase											=					new_node
															__lowercase											=					self.head
															__lowercase											=					None
															__lowercase											=					new_node





			def 		snake_case__      (					self						:							Optional[Any] )    ->       T | None:
									"""simple docstring"""







									if self.head is None:
															return None
									else:
															assert self.head is not None
															__lowercase											=					self.head.data
															__lowercase											=					self.head.next
															if self.head is not None:
																					__lowercase											=					None
															return temp





			def 		snake_case__      (					self						:							Optional[Any] )    ->       T | None:
									"""simple docstring"""







									return self.head.data if self.head is not None else None





			def __len__(					self						:							List[str] )    ->       int:
									"""simple docstring"""







									__lowercase											=					self.head
									__lowercase											=					0
									while temp is not None:
															count += 1
															__lowercase											=					temp.next
									return count





			def 		snake_case__      (					self						:							Optional[Any] )    ->       bool:
									"""simple docstring"""







									return self.head is None







			def 		snake_case__      (					self						:							Optional[Any] )    ->       None:
									"""simple docstring"""







									print("""stack elements are:""" )
									__lowercase											=					self.head
									while temp is not None:
															print(temp.data      ,  end="""->""" )
															__lowercase											=					temp.next


# Code execution starts here
if __name__ == "__main__":
			# Start with the empty stack
			UpperCamelCase__			=    Stack()

			# Insert 4 at the beginning. So stack becomes 4->None
			print("Stack operations using Doubly LinkedList")
			stack.push(4)

			# Insert 5 at the beginning. So stack becomes 4->5->None
			stack.push(5)

			# Insert 6 at the beginning. So stack becomes 4->5->6->None
			stack.push(6)

			# Insert 7 at the beginning. So stack becomes 4->5->6->7->None
			stack.push(7)

			# Print the stack
			stack.print_stack()

			# Print the top element
			print("\nTop element is ", stack.top())

			# Print the stack size
			print("Size of the stack is ", len(stack))

			# pop the top element
			stack.pop()

			# pop the top element
			stack.pop()

			# two elements have now been popped off
			stack.print_stack()

			# Print True if the stack is empty else False
			print("\nstack is empty:", stack.is_empty())





