I need help with this Java assignment. All the necessary…

/in /by

Question Answered step-by-step I need help with this Java assignment. All the necessary… I need help with this Java assignment. All the necessary information will be provided below.import java.util.ArrayList;import java.util.List;/* * For this drill, you will get practice with recursive backtracking. As with * the previous drill that emphasized recursion, this drill will be more difficult * than other drills for many students. Start early! * * Remember these are all recursive backtracking problems. So make sure to ask yourself * the questions detailed in the slides. These questions will lead you to the answer. * All of the code should be in the general pseudocode shown in the slides. A shortened * version: * ——————————- * Base Case(s) – if all decisions have been made * * Recursive Case – must go through all decisions possible at that point in time * Choose – choose one decision out of all the options * Explore – recurse, trying to solve the problem with the choice you just made * Unchoose – need to undo the choice you made above so that you can try another choice! */public class Drill08 { /* Implement a recursive function named canMakeSum that takes a list of * integers and an integer target value (sum) and returns true if it is * possible to have some set of values from the list that sum to the * target value. * * For example, the list {2,1,1,3,5} and target value 9 should return true * (5 + 3 + 1 = 9). * However, the list {5,4,1,6} and target value 8 should return false. */ public static boolean canMakeSum(ArrayList list, int sum) { return false; } /* Implement recursive function named longestCommonSubsequence that returns the * longest common subsequence of two strings. Recall that if a string is a subsequence * of another, each of its letters occurs in the longer string in the same order, but * not necessarily consecutively. * * Some examples: * longestCommonSubsequence(“tyler”, “kate”) -> “te” * longestCommonSubsequence(“hannah”, “banana”) “anna” * longestCommonSubsequence(“she sells”, “seashells”) “sesells” * longestCommonSubsequence(“CS210”, “arizona”) “” */ public static String longestCommonSubsequence(String s1, String s2) { return “”; } /* Implement recursive function named editDistance that accepts two string * parameters and returns the “edit distance” between the two strings as an * integer. Edit distance (also called Levenshtein distance) is the minimum * number of “changes” required to get from s1 to s2 or vice versa. A “change” * is a) inserting a character, * b) deleting a character, or * c) changing a character to a different character. * * Some examples: * editDistance(“driving”, “diving”) -> 1 * editDistance(“debate”, “irate”) -> 3 * editDistance(“football”, “cookies”) -> 6 */ public static int editDistance(String s1, String s2) { return -1; }} Computer Science Engineering & Technology Java Programming CS 165 Share QuestionEmailCopy link Comments (0)