<p><img alt="Use the following pseudocode for the merge phase of Mergesort on the following problems Assume arrays begin with index 0, and lines such as for i-a to b terminate
<p>Answering these questions:</p><p>1. What is the Big-O performance category in the worst case ofyour insert, delete, getRightNode and printLevel functions usingcompare operations</p><p>2. There are different strategies to implementing thisstructure, particularly
<h3>Question Description</h3> <p>1.<strong> Library Research, then write a 3-5 page paper</strong></p><p>Document a court case <strong>other than Frye, Coppolino or Daubert</strong>, in which either the Frye, Coppolino or Daubert Standards were