You should probably retry answering it. Or two people are already answering it.
-Edge
Answer: A) Make any simple fixes on their own.
Answer:
B.O(1)
Explanation:
When we are implementing ADT stack using linked chain we can pop an entry from the stack having O(1) time complexity because in linked chain we have the head or top pointer in linked chain only.Popping and pushing in stack happens on only one end that is top.So we have move to move top in linked chain to the next and delete prev node.
Another important advantage would be that the information you stored is portable and you may thus carry the CD right inside your pocket. Whenever you need it, you can retrieve it in a minute.
