Answer:
A stack data structure should be used. The time complexity of the insert, delete minimum and maximum operation is O(1).
Explanation:
The stack data structure is an indexed structure that holds data in an easily retrievable way. Data is held in a first-in last-out method as elements in the structure are popped out from the end of the stack when retrieved sequentially.
The worst-case time complexity of getting the minimum and maximum elements in a stack and deleting it is O(1), this is also true for inserting elements in the stack data structure.
Well it determends if there wearing them for sports or for fighting
if it is for sports then they are protected from balls and such
if it is for fighting then they are protected from bullets arrows and anything else you could think of
they are used to shield your face
Well it depends on the topic he is doing. if it is a list then a plain doc with a list of numbers. if he is writing a letter then he should use the letter template.
If u dont have anything important on there reboot it if you do choice 5
