Consider a doubly linked list storing student information $($name$,$ Student Number, DP$)$ with the following data: $($Alice$,40241001,67)<->($Bob$,40231002,84)<->($Charlie$,40221003,78)<->($David$,40201004,67)$Perform these tasks:

a$)$ Add a new student $($Eve$,40231005,3\mathrm{.}6)$ to the end of the list.

b$)$ Remove the student with ID $40231002$ from the list.

c$)$ Swap the positions of the first and last students in the list.

d$)$ Sort the list based on DP in descending order.

e$)$ Find and print the name of the student with the highest DP$.$

Write C$++$ code to implement these operations and explain the advantages of using a doubly linked list in this scenario