Question 3 [10]. Consider the Student struct as defined in Question 1 above. Implement the queue with doubly linked list whose each node has data component an instance of the struct Student. Implement the following: (i) enqueue three elements to the queue: (s1, 25, 20.25), (s2, 19, 25.17) and (s3, 23, 15.72) (get from user); (ii) print the queue; (iii) dequeue first element from the queue; (iv) get the size of the queue; (v) check whether the queue is empty or not; (vi) print the queue.