One form of this construct exhibits optimal performance with the impossible-to-implement Bélády’s algorithm. The valgrind utility is used to debug errors with this construct. Insufficient locality of this construct leads to thrashing, which involves (10[1])pages (10[1])of it constantly swapping. Calling “free” twice can lead to an incorrect (10[1])access of this construct (-5[1])called a segfault. (10[1])Pointers (-5[1])are so named for “pointing” (-5[1])to this construct. (-5[1])A form of this construct known as a cache can be used to reduce the number of reads (10[1])and writes to this construct’s “random-access” form. (10[3])For 10 points, name this construct whose size is measured in gigabytes. ■END■ (10[1])