Import java. util. scanner; public class simonsays { public static void main (string [] args) { scanner scnr = new scanner(system. in); string simonpattern; string userpattern; int userscore; int i; userscore = 0; simonpattern = scnr. next(); userpattern = scnr. next(); /* your solution goes here */ system. out. println("userscore: " + userscore); return; } }

Describe in pseudocode an algorithm that given an integer n and a linked list of elements increases the linked list by a factor of n by replacing each element in the original list with n copies of that element. for example, if l: [18, 7, 4, 24, 11] and n = 3 the resulting list should be l: [18, 18, 18, 7, 7, 7, 4, 4, 4, 24, 24, 24, 11, 11, 11]. if the value of n is less than or equal to 0, the list should be empty after the call. what’s the running time of your algorithm?

What is the foundation for proper monitoring, load balancing and routing in distributed systems

In a compound condition, both conditions on either side of the logical operator and must be true for the overall condition to be true. a: true b: false