Based on the functions given implement a remove function for a heap binary tree using arrays in C++ to remove the root of the tree and sort the tree

Paragraph Editing Click to add title vodsax heapity (int Art , int , int w) int left = 2*i+1 int right 2*i +2 if(left=0 ;i- largest = 1; if(right Arr[largest ] ) max_heapify (Arr, i); largest right ; if(largest i ) swap (Ar[i], Arr[largest]); max_heapify (Arr, largest,N); Paragraph Editing Click to add title vodsax heapity (int Art , int , int w) int left = 2*i+1 int right 2*i +2 if(left=0 ;i- largest = 1; if(right Arr[largest ] ) max_heapify (Arr, i); largest right ; if(largest i ) swap (Ar[i], Arr[largest]); max_heapify (Arr, largest,N)