QUESTION 23 The typical implementation of a heap uses an array data structure. Implement a method called isMaxPO that takes an array and checks if it is an array storing a max priority queue. The array will be in the standard format described in class (where the tree starts at index o). Your method must use the signature public static bool isMaxPO(int0 data) { T T | ? Paragraph ? Arial 3(12pt) ,??T. , NTML ESS Path: p Words:0