A red-black tree with n internal nodes has height at most 21g(n + 1). For a tree with n = 10, give a sequence of positive integers sigma = [sigma_1, sigma_2, ..., sigma_n] for sigma_i [1, 10], such that inserting that sequence into an empty red-black tree achieves the maximum height. Justify your claim