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.

Write a program in plp assembly that counts up by one starting from zero (or one) inside a loop and writes this value to the leds every time the value is increased. the memory address of the leds is 0xf0200000. the table below shows the meaning and an example usage of the instructions covered in the video, plp instructions for project 1. instruction example usage meaning load immediate li $t0, 8 register $t0 is set to the value, 8. store word sw $t2, 0($t1) the value in register $t1 is used as the memory address. the value in register $t2 is copied into this memory address. add addiu $t4, $t3, 29 register $t4 is assigned the sum of 29 and the value in register $t3. jump j your_label_name the program jumps to the line following the label, "your_label_name: ". label your label name: defines a label called "your_label_name: " that can be jumped to