1. Analysis of Sorting Algorithms Design a class AbstractSortthat can be used to analyze the number of comparisons performed bya sorting algorithm. The class should have a member functioncompare that is capable of comparing two array elements, and ameans of keeping track of the number of comparisons performed. Theclass should be an abstract class with a pure virtual memberfunction void sort(int arr[ ], int size) which, when overridden,will sort the array by calling the compare function to determinethe relative order of pairs of numbers. Create a subclass ofAbstractSort that uses a simple sorting algorithm to implement thesort function. The class
OR
OR