PLEASE ANSWER ALL PARTS IN JAVA

PLEASE ANSWER ALL PARTS IN JAVA

PLEASE ANSWER ALL PARTS IN JAVA

PART 1

PART 2

PART 3

PART 4

PLEASE ANSWER ALL PARTS IN JAVA

PLEASE ANSWER ALL PARTS IN JAVA

PLEASE ANSWER ALL PARTS IN JAVA

PLEASE ANSWER ALL PARTS IN JAVA

PLEASE ANSWER ALL PARTS IN JAVA

PLEASE ANSWER ALL PARTS IN JAVA

PLEASE ANSWER ALL PARTS IN JAVA

PLEASE ANSWER ALL PARTS IN JAVA

PLEASE ANSWER ALL PARTS IN JAVA

PLEASE ANSWER ALL PARTS IN JAVA

PLEASE ANSWER ALL PARTS IN JAVA

PLEASE ANSWER ALL PARTS IN JAVA

PLEASE ANSWER ALL PARTS IN JAVA

PLEASE ANSWER ALL PARTS IN JAVA

PLEASE ANSWER ALL PARTS IN JAVA

Recall that a DNA sequence is a string over the alphabet (AC,G.T). The "GC-Content" of a DNA sequence is the proportion of characters of the sequence that are either G or C. For example, the GC-Content of the sequence ACGTA is 2/5 = 0.4. TASK: Write a static method called gcContent with one String parameter sequence. It should return the GC-Content of sequence as a double. Sample Input: Sample Output: 3.8 Write a program, test using stdin+stdout Time limit: 8 seconds Memory limit: 256 MB 1 // YOUR CODE HERE Recall that a 'palindrome" is a sequence that is the same forward and backwards. For example, the string 'RACECAR" is a palindrome because, if we reverse it, we get the some string TASK: Write a static method called isPalindrome with one String parameter word. It should return true if word is a palindrome otherwise, it should return false. You can assume word will only consist of capital letters. HINT: You can solve this problem quite elegantly using recursion! Sample Input: RACECAR Sample Output: true Write a program, test using stdin+stdout Time limit: 8 seconds Memory limit: 256 MB 11/ YOUR CODE HERE Recall that n! ('n factorial") = n (n-1) *(n-2) ... *32*1. TASK: Write a static method called factorial with one int parameter n. It should return n! You can assume 0