Hire a C++ Programmer

First Sorting Assignment Create a C++ program that implements either Insertion, Selection or Bubble sort. Linked List Homework 1 Create a program to create a Linked List to allow a teacher to input test scores. Use a negative value to be the terminal condition and end input. Add each new item to the end of the List. Add functions to print out a list of the scores and to return an average. Use a struct and supporting class to implement this, as we did in class. Linked List Homework 2 1. Write a simple airline ticket reservation program. The program should display a menu with the following options: reserve a ticket, cancel a reservation, check whether a ticket is reserved for a particular person, and display the passengers. The information is maintained on an alphabetical linked list of names. In a simpler version of the program, assume that tickets are reserved for only one flight. In a fuller version, place no limit on the number of flights. Create a linked list of flights with each node including a pointer to a linked list of passengers. 2. Write a simple line editor. Keep the entire text on a linked list, one line in a separate node. Start the program with entering EDIT file, after which a prompt appears along with a line number. If the letter I is entered with a number n following it, then insert the text to be followed before line n. If I is not followed by a number, then insert the text before the current line. If D is entered with two numbers n and m, one n or no number following it, then delete lines n through m, line n, or the current line. Do the same with the command L, which stands for listing lines. If A is entered, then append the text to the existing lines. E exists. Here is an example: EDIT testfile 1> The first line 2> 3> And another line 4> I 3 3> The second line 4> One more line 5> L 1> The first line 2> 3> The second line 4> One more line 5> Add another line // this is now line 5, not 3 5> D 2 // line 5, since L was issued from line 5 4> L // line 4, since one line was deleted 1> The first line 2> The second line 3> One more line 4> And another line 4> E Tree Problem Set 1. Write a program that accepts an arithmetic expression written in prefix (Polish) notation, builds an expression tree, and then traverses the tree to evaluate the expression. The evaluation should start after a complete expression has been entered. 2. Write a cross-reference program that constructs a binary search tree with all words included from a text file and records the line numbers on which these words were used. These line numbers should be stored on linked lists associated with the nodes of a tree. After the input file has been processed, print in alphabetical order all words of the text file along with the corresponding list of numbers of the lines in which the words occur.