Question: 3. What will be the time complexity of the following code?<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;iostream&gt;</span> using namespace std<span class="sy0">;</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="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="sy0">,</span><span class="nu0">6</span><span class="br0">}</span><span class="sy0">;</span> <span class="kw4">int</span> n <span class="sy0">=</span> <span class="kw4">sizeof</span><span class="br0">(</span>arr<span class="br0">)</span><span class="sy0">/</span><span class="kw4">sizeof</span><span class="br0">(</span>arr<span class="br0">[</span><span class="nu0">0</span><span class="br0">]</span><span class="br0">)</span><span class="sy0">;</span> <span class="kw4">int</span> d<span class="sy0">=</span><span class="nu0">4</span><span class="sy0">;</span> <span class="kw4">int</span> temp<span class="br0">[</span><span class="nu0">10</span><span class="br0">]</span><span class="sy0">;</span> &nbsp; <span class="kw1">for</span><span class="br0">(</span><span class="kw4">int</span> i<span class="sy0">=</span><span class="nu0">0</span><span class="sy0">;</span>i<span class="sy0">&lt;</span>d<span class="sy0">;</span>i<span class="sy0">++</span><span class="br0">)</span> temp<span class="br0">[</span>i<span class="br0">]</span><span class="sy0">=</span>arr<span class="br0">[</span>i<span class="br0">]</span><span class="sy0">;</span> &nbsp; <span class="kw4">int</span> j<span class="sy0">=</span><span class="nu0">0</span><span class="sy0">;</span> <span class="kw1">for</span><span class="br0">(</span><span class="kw4">int</span> i<span class="sy0">=</span>d<span class="sy0">;</span>i<span class="sy0">&lt;</span>n<span class="sy0">;</span>i<span class="sy0">++,</span>j<span class="sy0">++</span><span class="br0">)</span> arr<span class="br0">[</span>j<span class="br0">]</span><span class="sy0">=</span>arr<span class="br0">[</span>i<span class="br0">]</span><span class="sy0">;</span> &nbsp; <span class="kw4">int</span> k<span class="sy0">=</span><span class="nu0">0</span><span class="sy0">;</span> <span class="kw1">for</span><span class="br0">(</span><span class="kw4">int</span> i<span class="sy0">=</span>n<span class="sy0">-</span>d<span class="sy0">;</span>i<span class="sy0">&lt;</span>n<span class="sy0">;</span>i<span class="sy0">++,</span>k<span class="sy0">++</span><span class="br0">)</span> arr<span class="br0">[</span>i<span class="br0">]</span><span class="sy0">=</span>temp<span class="br0">[</span>k<span class="br0">]</span><span class="sy0">;</span> &nbsp; <span class="kw1">for</span><span class="br0">(</span><span class="kw4">int</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> cout<span class="sy0">&lt;&lt;</span>arr<span class="br0">[</span>i<span class="br0">]</span><span class="sy0">&lt;&lt;</span><span class="st0">" "</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:
O(d)
O(n)
O(n2)
O(n*d)
Answer: B