THIS IS LAB 4:

LAB FOUR - DYNAMIC STORAGE ALLOCATION DUE 2/26/20

THIS IS A COMPLETELY NEW LAB! IT IS NOT RELATED TO ANY PREVIOUS LABS

INPUT:

(2) READ IN THE SIZE OF THE ARRAY THAT YOU WANT from the CONSOLE.

(2) READ IN THE CONTENTS OF THE ARRAY from a FILE

WHAT SHOULD IT DO?

THIS PROGRAM SHOULD BE ABLE to DYNAMICALLY ALLOCATE an ARRAY the SIZE requested, and then, SORT in ASCENDING ORDER.

Note: YOU MAY USE A SECOND ARRAY TO STORE and REORDER DATA.

OUTPUT (Nicely formatted :) ) :

(1) The ORIGINAL ARRAY

(2) The Sorted Array

I NEED THIS LAB 8 DONE PLEASE:

LAB EIGHT - MODIFICATIONS to LAB FOUR

MODIFY LAB FOUR,THE DYNAMIC ALLOCATION LAB, TO BE ABLE TO ELIMINATE ANY REDUNDANCY in the ARRAY RESULT.

This means, for Example, the Array looks like this:

1 2 3 5 7 8 1 3 4 9

The Original Array would output the list of numbers above.

The Sorted Array would print out the list in order.

The "Sorted List without Redundancy" would print:

** 1 2 3 4 5 7 8 9 (but also include the following...)

There are 2 Ones in the list.

THERE ARE 2 Threes in the list.

OUTPUT:

PRINT THE ORIGINAL ARRAY and the SORTED ARRAY** as detailed above.

**Note:

Be sure to OUTPUT HOW MANY TIMES A NUMBER APPEARED IN THE ORIGINAL ARRAY, AND ONLY INCLUDE IT, i.e., THE NUMBER, ONCE in the SORTED ARRAY.

CODE IN C++ PROVIDE THE ENTIRE CODE, ANY FILES AND OUTPUT YOU WILL GET!! If also possible please write comments throughout the code! Thank you! :) I will thumbs up if done correctly.