Write pseudocode of an insertion sort algorithm. Illustrate the execution of the algorithm on the array X $=\{2,11,98,23,48,33,97,61,3\},$ writing the intermediate values of X at each iteration of the algorithm. Then, create a flowchart that correlates to your algorithm.