Your tasks Implement the functions marked with ??? in withProb.scala. （as shown in below） package withProb:   /**    * NOTE: The seed should be System.nanoTime or something similar    * in order to get real pseudo-randomness but we fix it now    * for the sake of repeatability.    */   val rand = new scala.util.Random(2105)   /**    * Executes the given code with probability "prob".    * For instance,    *   doWithProb(30.0) { Console.println("I'm feeling lucky!") }    * shall print the text to the console with probability of 30 percent.    *    * Note that you have to modify the type of the "thenAction" parameter so that it admits code    * to be passed in "call-by-name" evaluation mode.    * Please see the course material and    * http://docs.scala-lang.org/tour/automatic-closures.html    */   def doWithProb(prob: Double)(thenAction: Unit): Unit =     require(0.0 <= prob && prob <= 100.0)     ???   end doWithProb   /**    * The expression    *   withProb(prob) {choice1} otherwise {choice2}    * returns the value of the first choice code with probability prob and    * the value of the second choice with probability 1-prob.    *    * For instance,    *  val x = 2    *  val y = 3    *  val z: Int = withProb(30.0) {x*y} otherwise {0}    * shall return 6 with 30% probability and 0 with 70% probability.    *    * Observe that we can also write a statement like    *  withProb(70.0) { println("first action") } otherwise { println("second action") }    * The return value is just ignored.    *    * Note that you have to modify the types of the choice1 and choice2 parameters so that they admit code    * with correct return type to be passed in "call-by-name" evaluation mode.    * Again, please see the course material and especially    * http://docs.scala-lang.org/tour/automatic-closures.html    * for help.    */   def withProb[T](prob: Double)(choice1: Any): withProbElse[T] =     require(0.0 <= prob && prob <= 100.0)     ???   end withProb   protected class withProbElse[T](prob: Double, choice1: Any):     def otherwise(choice2:  Any): T =       ???     end otherwise

So how fast is the merge sort? Does it depend on the type of array? We saw with some of our previous sorts that it depended on the initial array. For example, an Insertion sort was much faster for a nearly sorted array. In this exercise, you are given the Sorter class, which contains a static mergeSort method that takes an int array and length as an input. You are also given the SortTester class which has three static methods for creating 3 different types of arrays. For this test, create one of the three arrays, then take a start time using System.currentTimeMillis(). Next, run the array through the mergeSort method in the Sorter class. Finally, record the end time and print out the results. Repeat this for the other two array types. Sample Output Random Array: ** Results Hidden ** Almost Sorted Array: ** Results Hidden ** Reverse Array: ** Results Hidden **

In this project you will implement a Set class which represents a general collection of values. For this assignment, a set is generally defined as a list of values that is sorted and does not contain any duplicate values. More specifically, a set shall contain no pair of elements e1 and e2 such that e1.equals(e2) and no null elements. Requirements To ensure consistency among all implementations there are some requirements that all implementations must maintain. • Your implementation should reflect the definition of a set at all times. • For simplicity, your set will be used to store Integer objects. • An ArrayList<Integer> object must be used to represent the set. • All methods that have an object parameter must be able to handle an input of null. • Methods such as Collections.sort that automatically sort a list may not be used. • The Set class shall reside in the default package. Recommendations There are deviations in program implementation that are acceptable and will not…

In this project you will implement a Set class which represents a general collection of values. For this assignment, a set is generally defined as a list of values that is sorted and does not contain any duplicate values. More specifically, a set shall contain no pair of elements e1 and e2 such that e1.equals(e2) and no null elements. Requirements To ensure consistency among all implementations there are some requirements that all implementations must maintain. • Your implementation should reflect the definition of a set at all times. • For simplicity, your set will be used to store Integer objects. • An ArrayList object must be used to represent the set. • All methods that have an object parameter must be able to handle an input of null. • Methods such as Collections.sort that automatically sort a list may not be used. • The Set class shall reside in the default package. Recommendations There are deviations in program implementation that are acceptable and will not impact the overall…