A job priority queue is implemented using a Min$-$Heap in which a lower key value means a higher priority. The jobs are entered and stored in the Min$-$Heap as shown in the following array Q$.$

index $012345678910111213141516$

keyvalue $681012241513201826$

After two jobs are extracted from the job queue for execution, a new job with priority $11$ is inserted into the job queue. Please draw the Min$-$Heap..