Question: 3. What does the following code do?<div class="hk1_style-wrap4"><div class="hk1_style-wrap3"><div class="hk1_style-wrap2"><div class="hk1_style-wrap"><div class="hk1_style"><div class="c"><pre class="de1"><span class="co2">#include&lt;stdio.h&gt;</span> <span class="co2">#include&lt;stdlib.h&gt;</span> <span class="kw4">struct</span> Node <span class="br0">{</span> <span class="kw4">int</span> val<span class="sy0">;</span> <span class="kw4">struct</span> Node<span class="sy0">*</span> next<span class="sy0">;</span> <span class="br0">}</span><span class="sy0">*</span>head<span class="sy0">;</span> <span class="kw4">int</span> linear_search<span class="br0">(</span><span class="kw4">int</span> value<span class="br0">)</span> <span class="br0">{</span> <span class="kw4">struct</span> Node <span class="sy0">*</span>temp <span class="sy0">=</span> head<span class="sy0">-&gt;</span>next<span class="sy0">;</span> <span class="kw1">while</span><span class="br0">(</span>temp <span class="sy0">!=</span> <span class="nu0">0</span><span class="br0">)</span> <span class="br0">{</span> <span class="kw1">if</span><span class="br0">(</span>temp<span class="sy0">-&gt;</span>val <span class="sy0">==</span> value<span class="br0">)</span> <span class="kw1">return</span> <span class="nu0">1</span><span class="sy0">;</span> temp <span class="sy0">=</span> temp<span class="sy0">-&gt;</span>next<span class="sy0">;</span> <span class="br0">}</span> <span class="kw1">return</span> <span class="nu0">0</span><span class="sy0">;</span> <span class="br0">}</span> <span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span> <span class="br0">{</span> <span class="kw4">int</span> arr<span class="br0">[</span><span class="nu0">5</span><span class="br0">]</span> <span class="sy0">=</span> <span class="br0">{</span><span class="nu0">1</span><span class="sy0">,</span><span class="nu0">2</span><span class="sy0">,</span><span class="nu0">3</span><span class="sy0">,</span><span class="nu0">4</span><span class="sy0">,</span><span class="nu0">5</span><span class="br0">}</span><span class="sy0">;</span> <span class="kw4">int</span> n <span class="sy0">=</span> <span class="nu0">5</span><span class="sy0">,</span>i<span class="sy0">;</span> head <span class="sy0">=</span> <span class="br0">(</span><span class="kw4">struct</span> Node<span class="sy0">*</span><span class="br0">)</span><span class="kw3">malloc</span><span class="br0">(</span><span class="kw4">sizeof</span><span class="br0">(</span><span class="kw4">struct</span> Node<span class="br0">)</span><span class="br0">)</span><span class="sy0">;</span> head<span class="sy0">-&gt;</span>next <span class="sy0">=</span> <span class="nu0">0</span><span class="sy0">;</span> <span class="kw4">struct</span> Node <span class="sy0">*</span>temp<span class="sy0">;</span> temp <span class="sy0">=</span> head<span class="sy0">;</span> <span class="kw1">for</span><span class="br0">(</span>i<span class="sy0">=</span><span class="nu0">0</span><span class="sy0">;</span> i<span class="sy0">&lt;</span>n<span class="sy0">;</span> i<span class="sy0">++</span><span class="br0">)</span> <span class="br0">{</span> <span class="kw4">struct</span> Node <span class="sy0">*</span>newNode <span class="sy0">=</span> <span class="br0">(</span><span class="kw4">struct</span> Node<span class="sy0">*</span><span class="br0">)</span><span class="kw3">malloc</span><span class="br0">(</span><span class="kw4">sizeof</span><span class="br0">(</span><span class="kw4">struct</span> Node<span class="br0">)</span><span class="br0">)</span><span class="sy0">;</span> newNode<span class="sy0">-&gt;</span>next <span class="sy0">=</span> <span class="nu0">0</span><span class="sy0">;</span> newNode<span class="sy0">-&gt;</span>val <span class="sy0">=</span> arr<span class="br0">[</span>i<span class="br0">]</span><span class="sy0">;</span> temp<span class="sy0">-&gt;</span>next <span class="sy0">=</span> newNode<span class="sy0">;</span> temp <span class="sy0">=</span> temp<span class="sy0">-&gt;</span>next<span class="sy0">;</span> <span class="br0">}</span> <span class="kw4">int</span> ans <span class="sy0">=</span> linear_search<span class="br0">(</span><span class="nu0">60</span><span class="br0">)</span><span class="sy0">;</span> <span class="kw1">if</span><span class="br0">(</span>ans <span class="sy0">==</span> <span class="nu0">1</span><span class="br0">)</span> <span class="kw3">printf</span><span class="br0">(</span><span class="st0">"Found"</span><span class="br0">)</span><span class="sy0">;</span> <span class="kw1">else</span> <span class="kw3">printf</span><span class="br0">(</span><span class="st0">"Not found"</span><span class="br0">)</span><span class="sy0">;</span> <span class="kw1">return</span> <span class="nu0">0</span><span class="sy0">;</span> <span class="br0">}</span></pre></div></div></div></div></div></div>
Options:
Finds the index of the first occurrence of a number in a linked list
Finds the index of the last occurrence of a number in a linked list
Checks if a number is present in a linked list
Checks whether the given list is sorted or not
Answer: C