1. Write a method that returns a random day of the week 2. Write a method that accepts an integer as a parameter and returns a String saying if the parameter is odd or even 3. 1, 2, 4, 8, 16 … are all powers of 2. Print out the first 30 numbers in this sequence. 4. 1, 2, 4, 8, 16 … are all powers of 2. Write a method that checks if a number is a power of 2 and returns true or false 5. 1, 8, 27, 81, 243 … are all powers of 3. Write a method that checks if a number is a power of 3 and returns true or false 6. The first few numbers of the Fibonacci sequence are 1, 1, 2, 3, 5, 8, 13, 21, … Note that the next number in the sequence is the sum of the last two numbers in the sequence. Use a for loop to print out the first 100 fibonacci numbers 7. Take a number n. If n is even, divide it by 2 to get n / 2. If n is odd, multiply it by 3 and add 1 to obtain 3n + 1. Repeat the process indefinitely. The Collatz Conjecture states that you will always reach 1. Write a method that accepts a number n as input and outputs all the numbers in the sequence, terminating when it reaches 1.