this is all one question

Problem 5: Linguistics Opens Virtual Engineers(20) Please give clear, concise and correct answers to each question in the context of this course. Unless otherwise stated, assume that n represents the number of keys in the structure. Do not forget to check your definitions! Binary Tree from a Static Array A common way to implement a complete or left complete binary tree where a static array. The the root node is mapped to index 0 of the array. The two nodes in the next level are assigned to array entries 1 and 2 from left o right. This process is repeated at each level of the complete binary tree binary heap. For you visual learners, the number shown for each node in the binary tree corresponds to its location in the static array.. 0 1 2 / 5 3 4 6 5.1-5.2 Briefly explain two benefits of the static array implementation of a binary tree over a dynamic implementation (with parent and child pointers) of the binary tree for the binary heap. 5.3 Give an expression for the size of a static array required to contain an 1-node binary tree which is not known to be complete or left complete. 5.4 Briefly explain why the use of static lists to implement binary trees is typically restricted to structures such as binary heaps which are known to be complete. Be as specific as possible for full credit. 5.5 Suppose that we decided to allow the size of our static array to grow. What would be a sensible way to increase the size of our static array implementation of a binary tree? Justify your answer for full credit