12:09 O & R all 86% Asgn5 Part 2 - recursion For this part, you have 2 small programs to write (independent of each other). In both cases, write only one class, with one recursive static method and one main method. The main method should have some example code showing how the recursive method is called, with hardcoded values. 1. Write a recursive method that calculates the total space used by all files under a given folder (or directory), including all files that are accessible from it when traversing down some subfolders. Here are some methods that could help you here, that are part of the class "File": isFile() : returns true if the file is a regular file (not a directory) isDirectory() : returns true if the file is a directory length() : returns a value of type "long" (not int), that is the number of bytes taken by the file. Note that it has to be called on a normal file only, not on a directory. listFiles() : called on a directory, it returns an array of File objects corresponding to the content of that directory (i.e., all its files and subfolders) Note: you can check the correctness of your answer by checking the properties of the directory (right-click on the directory, and select "properties"). 2. Write a recursive method that starts with one string (e.g., "ABC") and prints all combinations of letters from that string (one per line). For example here, we would get (note: your answer could be in a different order): АВС АВ АС A ВС В C

Code 16-1   /** This class has a recursive method.  */    public class EndlessRecursion {    public static void message() {    System.out.println("This is a recursive method.");  message();  } }   Code 16.2   /**  This class has a recursive method message,  which displays a message n times.  */   public class Recursive {  public static void messge (int n) {    if (n>0) {    System.out.println (" This is a recursive method.");  message(n-1);  } } }     Task #1 Tracing Recursive Methods 1. Copy the file Recursion.java (see Code Listing 16.1) from the Student Files or as directed by your instructor. 2. Run the program to confirm that the generated answer is correct. Modify the factorial method in the following ways: a. Add these lines above the first if statement: int temp; System.out.println("Method call -- " + "calculating " + "Factorial of: " + n); Copyright © 2019 Pearson Education, Inc., Hoboken NJ b. Remove this line in the recursive section at the end of the method: return…

Lab Goal : This lab was designed to teach you more about recursion. Lab Description : luckyThrees will return a count of the 3s in the number unless the 3 is at the start. A 3 at the start of the number does not count. /* luckyThrees will return the count of 3s in the number* unless the 3 is at the front and then it does not count* 3 would return 0* 31332 would return 2* 134523 would return 2* 3113 would return 1* 13331 would return 3* 777337777 would return 2* the solution to this problem must use recursion*/public static int luckyThrees( long number ){}    Sample Data : 331332134523311313331777337777   Sample Output : 022132

Demonstrate Recursion Assignment Instructions Overview The programs we’ve discussed so far are generally structured as methods that call one another in a hierarchical manner. For some problems, it’s useful to have a method call itself—this is known as a recursive method. Such a method can call itself either directly or indirectly through another method. Recursion is an important topic discussed at length in upper-level computer-science courses. Instructions Write a recursive method printArray() that displays all the elements in an array of integers, separated by spaces. The array must be 100 elements in size and filled using a for loop and a random number generator. The pseudo-code for this is as follows:   //Instantiate an integer array of size 100 //fill the array For (int i=0; i<array.length; i++) Array[i] = random number between 1 and 100 inclusive printArray(integer array);   For this assignment make sure that your screen shots show your program running and that your runtime…