String Refinement Fill in the refineStringArray method so that it returns an array of all the Strings in the given array that have length greater or equal to the length of a given string. If the array is null or empty, or the given string is null, return null. The output strings should be in the same order they appear in the original array. Note that if the array contains any null element, then you need to skip that null element. Example 1 refineStringArray (new String[] {"Hello World", "a", "abc"}, "oop") should return {"Hello World", "abc"} public class StringRefinement{ public static String[] refineStringArray (String[] strings, String toCompare) { refineStringArray (new String[] {"Hello World", "a", "abc"}, null); for (int i=0;i

NOTE: Please do not copy from another person's answer, if you do so, you will be given down vote/thumb down. Thank you! Also, No entire code is needed. Just provide the method for LList class in Java ------------------------------------------------------------------------------------------------------------------------------------------------------- Suppose that a list contains Comparable objects. Implement a method that returns a new list of items that are less than some given item. The header of the method could be as follows: public LList<T> getAllLessThan( Comparable<T> anObject) Write an implementation of this method for the class LList. Make sure that your method does not affect the state of the original list.

Please give a full detailed optimized solution in Java 8 for the given problem, use the example code provided as well. Please provide comments and screenshots of code and output. Also, add the time/space complexity and the reason for it.Java 8 Code Example:import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { public static void main(String args[] ) throws Exception { /* Enter your code here. Read input from STDIN. Print output to STDOUT */ } }

This is Java Programming! We are working with MaxHeap Instructions: Don't modify the two codes below. You need to make a MaxHeapInterface.java that implements the bstMaxHeap in the Driver.java code. If you haven't look at the code, look at them now. Driver.java code: /** A driver that demonstrates the class BstMaxHeap. @author Frank M. Carrano @author Timothy M. Henry @version 5.0*/public class Driver {public static void main(String[] args) { String jared = "Jared"; String brittany = "Brittany"; String brett = "Brett"; String doug = "Doug"; String megan = "Megan"; String jim = "Jim"; String whitney = "Whitney"; String matt = "Matt"; String regis = "Regis"; MaxHeapInterface<String> aHeap = new BstMaxHeap<>(); aHeap.add(jared); aHeap.add(brittany); aHeap.add(brett); aHeap.add(doug); aHeap.add(megan); aHeap.add(jim); aHeap.add(whitney); aHeap.add(matt); aHeap.add(regis); if (aHeap.isEmpty()) System.out.println("The heap is empty -...

IN JAVA PLEASE

There are a few errors in this java code: can you fix it please, its basically a debugging exercise: public static int sum(int n){ int n; for (int i=1; i<=n;i--){ sum++; } return sum; } }

Can you do this please? Thank you

In JAVA

java: Explain the 3 methods used to make Deep Copies.