Objective: – Use fundamental data structures such as stacks, queues, linked-lists, and trees to represent data and meet application requirements. – Demonstrate knowledge of recursion by describing common applications and by effectively using it to solve problems. – Use appropriate algorithms to solve common computing problems. Problem: In this problem, you will rearrange the nodes in a linked-list from the smallest integer to the largest integer (i.e., the head node should hold the smallest inte