Implement `heapInsert(arr, val)` returning a new min-heap array after adding `val` and sifting it up to its correct position.
+ 1 hidden test run on Submit.
Appending then sifting up restores the heap in O(log n).
Run your code to see results.