help me complete these methods

public class Recursions {

/* Complete the following method. The method is to return the number of possible ways to fill a sequence of (linear) slots with sticks of length 1 and length 2. For example, if there are 3 slots, the number will be 3 (A represents the stick of length 1 and B of length 2. ABB AAB AAA You can assume that the number of sticks is infinite. @param Slots @return */ public static int fillLine1_2(int Slots) { //type the code here }

/* Given an array of ints, write a method that checks if there is a subset of ints, such that the subset sum is equal to the target value. Consider the following constraints: (1) All multiples of 7 in the array must be added to the subset sum, (2) if 7 follows 3, 3 cannot be added. If needed, write additional helper method(s). @param start initial value passed to subsetSum7. @param nums @param target @return */ public static boolean subsetSum7(int start, int[] nums, int target) { //type your code here }

}