Use the following graph to trace through Prim’s and Kruskal’s MST algorithms. When a starting point is needed, use the node C as this starting point. Then answer the four questions about these traces. Use the notation XY for edges where X and Y are the two nodes the edge connects, listing the nodes in alphabetic order. How many edges must an MST for this graph contain? What is the first edge added to the MST when tracing through Prim’s algorithm? What is the first edge added to the MST when tracing through Kruskal’s algorithm? What is the last edge added to this MST (both algorithms should yield the same answer)?

Trace through the execution of this program. What value is printed? import java.util.Arrays;import java.util.List;public class stream {  public static void main(String[] args) {    List x = Arrays.asList(1, 2, 3, 4, 5);    long y = x.stream().map(xi -> xi * xi)    .filter(xi -> xi % 2 == 0)    .count();    System.out.println(y);  }}

What order are nodes (successors of edges) first added to the Priority Queue while tracing through Prim’s algorithm on the following graph? If a starting point is necessary, start from node U.

Similar to A07.GUIProgramming, this Solid.js effect runs a one-second countdown while the round is active and cleans up its interval when the round ends. Fill in each by choosing the best option from the dropdowns after the code block.   const = createSignal(20);  const   = createSignal(true);  createEffect(() => {   if (!    ) return;    const id = setInterval(() => {     const remaining =    – 1;     (remaining);      if (remaining clearInterval(id));  });

Which of the following strings does not match the regex “pie?a?(zza)+(s|z)*”

Cognitive Psychology

Personality Psychology

Health Psychology

Developmental Psychology

Sport and Exercise Psychology