03 a. Define an Array State four conventional rules in using Arrays as a data structure c. Using a Linked List as a preferred Data Structure in developing an application, state and explain how these operations can be applied on the linked List: Insertion ii. Deletion IN Linear Search 4. Explain how lusertion is done in a Queue 04 a) b) a leaf Define the following terms a forest c) tree transversal d) Terminal node c) node For the binary tree below list the terminal nodes, the non-terminal nodes and the level of each node Draw the internal memory representation of the binary tree below using il a. Sequential list b. Linked. Structures iv. Given the binary tree above, traverse both PREORDER and POSTORDER Comment on the Two traversals