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.
Your answer your looking for is letting D because you don’t know it or it don’t have anything to do with you...
Answer:
Protection for your business and Increased productivity
Explanation:
This is because it ensures your employees aren't at risk from potential threats and, since there no virus, the computers will work well (not slow down)
Answer:
log base 3a= -0.631.log a/3 base 3
Now, -log m= log 1/m
hence,
log base 3a= 0.631.log 3/a base 3
log base 3a/log 3/a base 3 =0.631
log base 3 ( a.3/a) =.631 since, log m/logn =log n(m)
log base 3 3=0.631
Hence, answer is log base 3 3=0.631
Explanation:
Please check the answer section.
I’m pretty sure it’s true! Brainliest if correct
