For each structure below, create a new file called practice-[ds].js and require the appropriate data structure implementation as needed. Then, code out each of the following requirements by hand.
Process a Queue and a Stack in the correct order practice-stack.js', practice-queue.js` Iterate a linked list, printing out the values practice-linked-list.js Traverse a Binary Tree, printing out the values as you visit each node. practice-trees.js Breath First Depth First: Pre-Order Depth First: In-Order Depth First: Post-Order Traverse a Graph, printing out the value on each vertex as you visit practice-graph.js Breadth First Depth First Write QuickSort, MergeSort, InsertionSort functions for an array practice-sorting.js