Data structures

Select one:

a. Option 1

b. Option 2

c. Option 1 and Option 2 have the same efficiency

HEAD1 Tail Tail HEAD We want to implement this queue by linked list. Which one is more efficient to implement it? (consider enqueue and dequeue, note that enqueue happens at tail and dequeue happens at head) Option 1: head-11->22->33->4444->33->22->11-head Head