ASAP

HW3 Implement MyArraylist and MyLinkedList using MyList interface and MyAbstractlist as defined in Java Collection Framework (5 points) Write code to partition a linked list around a value x, such that all nodes less than x come before all nodes greater than or equal to x. If x is contained within the list, the values of x only need to be after the elements less than x. The partition element x can appear anywhere in the right partition", it does not need to appear between the left and right partitions. . Input: 3->585121 (partition-5) Output: 3->1-92310>5 598 For the following problem use your own created MyArrayList or . MyLinkedList if needed. (10 points) Given an array of words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justified You should pack your words in a greedy approach; that is, pack as many words as you can in each line. Pad extra spaces when necessary so that each line has exactly maxWidth characters. Extra spaces between words should be distributed as evenly as possible. If the number of spaces on a line do not divide evenly between words, the empty slots on the left will be assigned more spaces than the slots on the right. For the last line of text, it should be left justified and no extra space is inserted between words