I WILL GIVE DISLIKES $!!!$ IF ANYTHING WRONG HAPPENS IN MY QUESTION, BETTER SKIP IT$!!!$

Don't Give the solution and explaination.The trouble with binary search trees is that they can become unbalanced depending on the order that you insert valuesDon't solve else I will Punish You. Give an SC$04$ order for inserting the letters I, P$,$ A$,$ F$,$ W$,$ Q$,$ X$,$ E$,$ G$,$ N$,$ S$,$ B$,$ Z such that the resulting tree is a complete binary search treeI told you not to solve any part Please make that your intermediate trees are also complete binary search trees as wellAppologies for not answering the question