In this exercise, your task is to run the build-heap algorithm on the heap. The min-heap is visualized both as a binary tree and array and the exercise can be completed by swapping keys in either visualization. You can swap two elements by first clicking on one element and then another.