Analyze a bubble sort and merge sort in C++. Create two projects, one for each sort in the given choices.

Use 4 data set sizes. Results will be based on execution time for each sort. The size should have a regular increment. For example, using a regular increment of 1,000, you might have sizes of 1,000, 2,000, 3,000, and 4,000. Choose your data size based upon the ability to obtain meaning results.

Submit:

1. A Word document named SortDescriptionsLastName.docx. The Word document should have:
   1. Two screen shots of your program displaying the sorted array for each sort. The display of each value should include the index and value of each element in the array. These screen shots of course will not show your entire array but only a part.
2. Code for the algorithm in a working program (similar to SelectionSort.cpp).
   1. Code should use meaningful identifiers
   2. Code should be well-structured and easy to read.