LinkedCompress Editor 1 node compressCnode* head) //fill in code here Problem Statement 4 This problem has you modify a linked lists composed of node objects chained together via node pointers. Each node has a next pointer which points to the next node in the chain. The last node is identified by having a NULL next pointer. The linked lists for this lab store string data. Some of the strings in the linked lists repeat, and we'd like to eliminate this repetition. Specifically, if a string repeats, we want to eliminate the duplicates so that the resulting linked list only has one copy of a string in a row. (The string can repeat later in the linked list, as long as some other string occurs in between.) Create a function compress, which takes in a pointer to the head of the linked list, and returns a pointer to the head of a linked list in which repetition has been eliminated The linked list for this problem uses the following class declaration class node public: string data; node* next; d: Notes and Constraints The linked list starting at head contains between 1 and 25 nodes, inclusive Test Submit

In Java, a global variable is declared inside a method and is accessible only in that method. -True -False

def area(side1, side2):       return side1 * side2s1 = 12s2 = 6Identify the statements that correctly call the area function. Select ALL that apply.   Question options:   area(s1,s2)   answer = area(s1,s2)   print(f'The area is {area(s1,s2)}')   result = area(side1,side2)

Object-Oriented Programming ❤❤❤ Matchmaker with Java ❤❤❤ Summary: Create a Java application that will determine your true love. Prerequisites: Java, VS Code, and Terminal In this assignment you will develop and test a command-line application written in the Java language that asks questions to determine if a person is your true love. More specifically your application should ask five questions in the form of statements and allow the user to respond to each statement with the numbers 1 through 5 with 1 indicating strongly disagree and 5 indicating strongly agree. You will then compare the person’s answers with your desired “true love” answers. The closer the answers are to your desired “true love” answers the better match the two of you are for each other. For example, suppose you choose the statement “Broccoli is delicious.” and your desired answer was 1 (strongly disagree) because you really don’t like broccoli. If the application user entered 4 (agree), then the two of you would not…