8. Write a method called withFaire that switches the order of values in the list in a pairwise fashion. Your method should switch the order of the first two values, then switch the order of the next two switch the order of the next two, and so on. If the list contains an odd number of values, the final element is not moved. For example, if the list initially stores 110. 25. 2. 2. 65,721. your method should switch the first pair Co and 26), the second pair (1 and 4%), and the third pair (2 and 6) to yield 125, 10, 44. 1. 11. 12. 13 9. Write a method called stutter that doubles the size of a list by replacing every integer in the list with two of that integer Farmnicus 12. Write a method called split that rearranges the elements of a list so that all of the negative values appear before all of the nonnegatives. For example, suppose a variablet stores the values 11, 1.-4. 19. 0.43, -, -, 21. The call of list.it should rearrange the list to put the negatives first: ,,... 4. 19. o. 4. It doesn't matter what order the numbers are in, only that the negatives appear before the nonnegatives, so this is only one possible solution. You must solve the problem by rearranging the links of the list, not by swapping date values or creating new nodes. You also may not use auxiliary structures like arrays or ArrayListe to solve this amiam les 8. Write a method called withFaire that switches the order of values in the list in a pairwise fashion. Your method should switch the order of the first two values, then switch the order of the next two switch the order of the next two, and so on. If the list contains an odd number of values, the final element is not moved. For example, if the list initially stores 110. 25. 2. 2. 65,721. your method should switch the first pair Co and 26), the second pair (1 and 4%), and the third pair (2 and 6) to yield 125, 10, 44. 1. 11. 12. 13 9. Write a method called stutter that doubles the size of a list by replacing every integer in the list with two of that integer Farmnicus 12. Write a method called split that rearranges the elements of a list so that all of the negative values appear before all of the nonnegatives. For example, suppose a variablet stores the values 11, 1.-4. 19. 0.43, -, -, 21. The call of list.it should rearrange the list to put the negatives first: ,,... 4. 19. o. 4. It doesn't matter what order the numbers are in, only that the negatives appear before the nonnegatives, so this is only one possible solution. You must solve the problem by rearranging the links of the list, not by swapping date values or creating new nodes. You also may not use auxiliary structures like arrays or ArrayListe to solve this amiam les