(3%) Considering the following implementation of min heap, which way of filling in the code to make function insert work correctly?

#define MAX_SIZE 10
int data[MAX_SIZE];
int size=0;
void insert(int x)
{
  if (size>=MAX_SIZE-1)  return;
  int cur= □□ ;
  while(cur!=0 && data[◇◇]>x) {
    data[cur]=data[◇◇];
    cur= ◇◇;
  }
  data[cur]=x;
}