Use recursion to develop a method, printTree, that displays the folder tree under a given path along with the total size of each folder/subfolder (the method does not display any files). A sample output is given below. The numbers on the far right are folder sizes in Bytes. Note how the parent folders are displayed above their subfolders. Try to format the output so that it matches the sample below. Do not worry too much about the order of the subfolders (e. g. they do not have to be sorted). You may develop and use helper methods. You can only import File and Stack classes. You are not allowed to import any other java libraries or readymade libraries from the internet

Write a function called checkfactor that takes two arrays of positive numbers, firstnumberrow and secondnumberrow. checkfactor checks if the first entry in firstnumberrow is divisible by the first entry in secondnumberrow, and performs the same operation on the next array elements until all entries have been checked. all the numbers are positive and the number of entries in the arrays are the same. the function should return the identified divisible numbers in two row arrays named firstdivisible and seconddivisible. restrictions: branches or loops should not be used. the code must use the internal mod and logical functions. hint: the mod function should be used to determine if two numbers are divisible. ex: for num1 and num2 if mod(num1,num2) is 0, then the two numbers are divisible. this is matlab