a数组中是一组升序的数，现由键盘输入一个待查的整数x,用二分法查找，若x存在输出其所在的位置,否则给出没找到信息。___处应填入的内容是k=1()。#include <stdio.h>#define N 10int main(){  int i,x,low,high,mid,k;int a[N]={25,28,37,44,65,76,79,83,85,92};low=0;high=N-1;scanf("%d",&amp;x);k=0;low=0;high=N-1;scanf("%d",&amp;x);low=0;high=9;k=0;scanf("%d",&amp;n);while (k==0 &amp;&amp; low<=high){  mid=(low+high)/2;if(x<a[mid]) high=mid-1 ;if(x>a[mid]) low=mid+1 ;if (x==a[mid])______;}if(k==1) printf("found,%d in position %dn",x,mid);else printf("%d no foundn",x);return 0;}