Given an alphabet of size N=9. Write a c++ program that compares the number of possible sequences of the length L that can be generated inder the following assumptions: With replacement order matters, without replacement order matters, and without replacement order does not matter. The program must output a formatted list comparing the number of possible sequences for L=5,6,7,8,9