Implement the below STOOGESORT algorithm to sort an array/vector of integers. Implement the algorithm in C++. The program must be able to read inputs from a file called data.txt where the first value of each line is the number of integers that need to be sorted, followed by the integers. The output will be written to a file called stooge.out.

StoogeSort(A[0 ... n - 1])

if n = 2 and A[0] > A[1]

swap A[0] and A[1]

else if n > 2

m = ceiling(2n/3)

StoogeSort(A[0 ... m - 1])

StoogeSort(A[n - m ... n - 1])

Stoogesort(A[0 ... m - 1])