






from statistics import mean

import numpy as np





def 					lowercase_ (    __snake_case     :							list	,	__snake_case     :							list	,	__snake_case     :							list	,	__snake_case     :							int      )     -> list:





				'''simple docstring'''


				snake_case__      :str         =   0
				# Number of processes finished
				snake_case__      :List[Any]         =   0
				# Displays the finished process.
				# If it is 0, the performance is completed if it is 1, before the performance.
				snake_case__      :str         =   [0] * no_of_process
				# List to include calculation results
				snake_case__      :Any         =   [0] * no_of_process

				# Sort by arrival time.
				snake_case__      :Tuple         =   [burst_time[i] for i in np.argsort(__snake_case      )]
				snake_case__      :Optional[Any]         =   [process_name[i] for i in np.argsort(__snake_case      )]
				arrival_time.sort()

				while no_of_process > finished_process_count:
								snake_case__      :str         =   0
								while finished_process[i] == 1:
												i += 1
								if current_time < arrival_time[i]:
												snake_case__      :Optional[int]         =   arrival_time[i]

								snake_case__      :Dict         =   0
								# Index showing the location of the process being performed
								snake_case__      :Optional[int]         =   0
								# Saves the current response ratio.
								snake_case__      :List[str]         =   0
								for i in range(0	,	__snake_case      ):
												if finished_process[i] == 0 and arrival_time[i] <= current_time:
																snake_case__      :int         =   (burst_time[i] + (current_time - arrival_time[i])) / burst_time[
																    i
																]
												if response_ratio < temp:
																snake_case__      :Dict         =   temp
																snake_case__      :List[Any]         =   i

        # Calculate the turn around time
								snake_case__      :List[Any]         =   current_time + burst_time[loc] - arrival_time[loc]
								current_time += burst_time[loc]
								# Indicates that the process has been performed.
								snake_case__      :List[Any]         =   1
								# Increase finished_process_count by 1
								finished_process_count += 1

				return turn_around_time





def 					lowercase_ (    __snake_case     :							list	,	__snake_case     :							list	,	__snake_case     :							list	,	__snake_case     :							int      )     -> list:





				'''simple docstring'''


				snake_case__      :Any         =   [0] * no_of_process
				for i in range(0	,	__snake_case      ):
								snake_case__      :Optional[Any]         =   turn_around_time[i] - burst_time[i]
				return waiting_time


if __name__ == "__main__":
							__UpperCAmelCase							:   Optional[Any]							=  5
							__UpperCAmelCase							:   Any							=  ["A", "B", "C", "D", "E"]
							__UpperCAmelCase							:   str							=  [1, 2, 3, 4, 5]
							__UpperCAmelCase							:   Any							=  [1, 2, 3, 4, 5]

							__UpperCAmelCase							:   str							=  calculate_turn_around_time(
							    process_name, arrival_time, burst_time, no_of_process
							)
							__UpperCAmelCase							:   Tuple							=  calculate_waiting_time(
							    process_name, turn_around_time, burst_time, no_of_process
							)

							print("Process name \tArrival time \tBurst time \tTurn around time \tWaiting time")
							for i in range(0, no_of_process):
														print(
														    F'''{process_name[i]}\t\t{arrival_time[i]}\t\t{burst_time[i]}\t\t'''
														    F'''{turn_around_time[i]}\t\t\t{waiting_time[i]}'''
														)

							print(F'''average waiting time : {mean(waiting_time):.5f}''')
							print(F'''average turn around time : {mean(turn_around_time):.5f}''')







from __future__ import annotations


class 					_snake_case						:






	def __init__(		self					,UpperCamelCase       )						->    None:
					snake_case__      :Union[str, Any]         =   data
					snake_case__      :Node | None         =   None
					snake_case__      :Node | None         =   None





def 					lowercase_ (    __snake_case     :							Node | None      )     -> None:  # In Order traversal of the tree





				'''simple docstring'''


				if tree:
								display(tree.left      )
								print(tree.data      )
								display(tree.right      )





def 					lowercase_ (    __snake_case     :							Node | None      )     -> int:





				'''simple docstring'''


				return 1 + max(depth_of_tree(tree.left      )	,	depth_of_tree(tree.right      )      ) if tree else 0





def 					lowercase_ (    __snake_case     :							Node      )     -> bool:





				'''simple docstring'''


				if not tree:
								return True
				if tree.left and tree.right:
								return is_full_binary_tree(tree.left      ) and is_full_binary_tree(tree.right      )
				else:
								return not tree.left and not tree.right





def 					lowercase_ (    )     -> None:  # Main function for testing.





				'''simple docstring'''


				snake_case__      :Dict         =   Node(1      )
				snake_case__      :int         =   Node(2      )
				snake_case__      :Optional[Any]         =   Node(3      )
				snake_case__      :Tuple         =   Node(4      )
				snake_case__      :str         =   Node(5      )
				snake_case__      :Optional[Any]         =   Node(6      )
				snake_case__      :List[Any]         =   Node(7      )
				snake_case__      :List[str]         =   Node(8      )
				snake_case__      :Tuple         =   Node(9      )

				print(is_full_binary_tree(__snake_case      )      )
				print(depth_of_tree(__snake_case      )      )
				print("Tree is: "      )
				display(__snake_case      )


if __name__ == "__main__":
	main()