implementing data structures using pseudo code.

In Weeks 1-4, you were provided with the foundation for implementing data structures using pseudo code.This week, you will finish the tasks and paper, including the incorporation of appropriate feedback that has been previously received. You will also complete some additional steps, outlined below.Part 1 Tasks (Objectives from Weeks 1–4):Review and revise your final paper, which should include the following content:Section 1: Lists, Stacks, and QueuesSection 2: Hashing, Heaps and TreesSection 3: Sorting AlgorithmsSection 4: SearchingPart 2 Tasks (Objective(s) from Week 5): Finalize Your Key AssignmentIn addition, include pseudo code for a routine that will prompt the user for a number. You will then calculate the factorial of that number, using recursion.Week 5 Deliverables:The following sections should be completed, including the collaboration of each section IP. Feedback received from the instructor and peers should be incorporated into the final paper.Title PageTable of ContentsAbstractProject Outline/Project BackgroundSection 1: Lists, Stacks, and QueuesSection 2: Hashing, Heaps and TreesSection 3: Sorting AlgorithmsSection 4: SearchingSection 5: RecursionConclusionReferencesNew ContentCreate a pseudo code routine that will ask the user for a number, and then using recursion, generate the factorial of that number.Create fully documented pseudo code to prompt for a number and generate the factorial, including error and bound checking.Create a test plan to show how the program runs and can be executed.Name the document “IT265__Final.doc.”