PLEASE HELP ASAP C++! ALL NEEDED DETAILS ARE THERE IN THE PROBLEM.

PROBLEM 4 30 POINTS Create a doubly-linked list data structure that can be traversed both forwards and backwards by a single node at a time or by forwards using a "fast-forward traversal to advance 5 nodes at a time if there are at least 5 nodes after the current node. (If there are less than 5 nodes after the current node, then no fast- forward traversal can be performed from the current node.) a) Describe the functionality of your data structure and how it achieves the fast-forward traversal. Illustrate how your data structure would store the following list. Show all pointers! (10 points) [44,3,9,15,62,0,11, 21, 22, 26, 19, 10] b) Design an algorithm to use the fast-forward traversals to more quickly search through a sorted doubly- linked list structure for a large list with size N > 1,000. Describe your algorithm using pseudocode. (10 points) c) You are given a large list with size N > 1,000 stored using this doubly-linked list structure with fast- forward traversals. You wish to insert an element in the middle of this list. How many pointers do you need to modify (including the pointers for the new element) to perform this insertion? Justify your answer. (10 points)