Answer:
A.O(1)
Explanation:
In the implementation of queue by using linked chain the performance of the enqueue operation is O(1).We have to maintain two pointers one head and the other tailand for enqueue operation we have to insert element to the next of the tail and then make that element tail.Which takes O(1) time.
Poster because if you have that much space....well what I do is calculate it by the centimeters in square divide:)
Explanation:
Pretty sure its a group of two or more computers that are linked thogether