For any [x] EZ/n and any kEZ, we can define k[x] by k[x] = [x] + [x] + ... + [x] k times where the result is an element of Z/n. We say k[x] is a multiple of [x]. (a) List all the multiples of [3] in Z/9. (Select all that apply.) [0] [1] [2] [3] [4] [5] ☐ [6] [7] [8] (b) List all the multiples of [3] in Z/8. (Select all that apply.) ☐ [0] □ [1] [2] [3] [4] [5] [6] [7]

make the array an arraylist instead and include the file you used

Two words (spelt in uppercase) are similar if and only if all letters in the 1st word are in the 2nd word and all letters in the 2nd word are in the 1st word; including the same number of duplications. For example, ABBA and BABA are similar; however, BABA and BAAA are not similar. To check two words which are similar, we can use two integer arrays, each has 26 elements (as we have 26 letters), you can assume that 1st array element stores the number of letter 'A', 2nd array element stores the number of letter 'B', and so on. What you need to do now is to check whether the two integer arrays are equal to decide whether the two words are similar. We propose following UML for this question: O TwoWords - String word1 -String word2 O Exam_Q4 +TwoWords0 - static Scanner input +TwoWords(String word1, String word2) O+TwoWords(TwoWords tw) O+ String getWord10 O+ static void main(String args) O+ String getWord20 O+void setinfo(String word1, String word2) O -intj countinfo (String word) O+boolean…

Write aJava function given an array of integers nums [passed by reference] and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order.