The next Problem A is about operations in a 2-3 4 tree (this is a B-tree with minimum degree t = 2). To help understand the operation of insertion, the following is an example of the evolution of a tree as the following values are added in the order given: C, O, R, N, F, L, A, K, E, S COR C N C F N F O F O Figure 1. 2-3-4Tree. Show the evolution of a 2-3-4 tree when the input is in the following order: S, E, K, A, L, F, N, R, O, C. You are not required to show every change, just the changes that lead to changes in the number of nodes, and also include the final tree