If we have a priority queue storing approximately million numbers, and the bottom level is "full", which of the following statements is false? (lower numbers have higher priority) A) The height of the structure is approximately 20. B) The width of the lowest level of the structure is approximately 500,000. C) Nearly half of the 1000 largest values must be in the bottom level of the structure. D) Nearly half of the 1000 smallest values must be in the top half of the tree (if there are k levels in the tree, the "top half" is the top k/2 levels). E) Nearly half of the 1000 smallest values may be in the bottom level of the structure.