An AVL tree is constructed by inserting the following numbers in this order: 1, 7, 2, 6, 3, 5, 4. The in-, pre- and post-order traversals of the resulting tree are: O In-order: 1, 2, 3, 4, 5, 6, 7 Pre-order: 4, 2, 1, 3, 6, 5, 7 Post-order: 1, 3, 2, 5, 7, 6, 4 In-order: 5, 1, 3, 4, 6, 7, 2 Pre-order: 6, 1, 5, 3, 4, 7, 2 Post-order: 5, 4, 3, 1, 2, 7, 6 In-order: 1, 2, 3, 4, 5, 6, 7 Pre-order: 3, 2, 1, 6, 5, 4, 7 Post-order: 1, 2, 4, 5, 7, 6, 3 In-order: 1, 2, 3, 4, 5, 6, 7 Pre-order: 2, 1, 6, 3, 4, 5, 7 Post-order: 1, 4, 5, 3, 7, 6, 2 None of the above