Let A be the array 8, 5, 2, 12, 6, 1. Run the bubble sort and insertion sort for this array. Each algorithm will modify this array step by step until it is sorted increasingly. List all the modi-cations. The answer is expected to be in the form: A → 5, 2, 8, 12, 6, 1 → 6, 12, 1, 8, 5, 2 →⋯ → 1, 2, 5, 6, 8, 12. Follow the code given in the textbook.