#include &lt;stdio.h&gt;    #include &lt;stdlib.h&gt;    int compareints &#40;const void * a, const void * b&#41;    &#123;        return &#40; *&#40;int*&#41;a - *&#40;int*&#41;b &#41;;    &#125;    int values&#91;&#93; = &#123; 50, 20, 60, 40, 10, 30 &#125;;    int main &#40;&#41;    &#123;        int * p;        int key = 40;        qsort&#40;values, 6, sizeof &#40;int&#41;, compareints&#41;;        p = &#40;int*&#41; bsearch &#40;&amp;key, values, 6, sizeof &#40;int&#41;, compareints&#41;;        if &#40;p != NULL&#41;        printf &#40;&quot;%d\n&quot;,*p&#41;;        return 0;    &#125;
A. 10
B. 20
C. 40
D. 30
Answer:A
#include &lt;stdio.h&gt;    #include &lt;stdlib.h&gt;    int compareints &#40;const void * a, const void * b&#41;    &#123;        return &#40; *&#40;int*&#41;a - *&#40;int*&#41;b &#41;;    &#125;    int values&#91;&#93; = &#123; 50, 20, 60, 40, 10, 30 &#125;;    int main &#40;&#41;    &#123;        int * p;        int key = 40;        qsort&#40;values, 6, sizeof &#40;int&#41;, compareints&#41;;        p = &#40;int*&#41; bsearch &#40;&amp;key, values, 6, sizeof &#40;int&#41;, compareints&#41;;        if &#40;p != NULL&#41;        printf &#40;&quot;%d\n&quot;,*p&#41;;        return 0;    &#125;
A. 10 B. 20 C. 40 D. 30
Explanation:In this program, We are searching for the element and then we are printing it.