Write a C++ program that implements the following three algorithms and times them for various values of n . The program should display a table of the run times of each algorithm for various values of n . // Algorithm A // Algorithm B // Algorithm C sum = 0 sum = 0 sum = n * (n + 1) / 2 for i = 1 to n for i = 1 to n sum = sum + i { for j = 1 to i sum = sum + 1 } For each of the following problems, you will need an implementation of the ADT bag whose method remove removes a random entry instead of a speci c one.