Draw a class diagram for the ADT List using a UML drawing tool.

a) Complete the program dependence graphs for the program shown above and 1. Add edges for data dependences in all graphs. 2. Combine the individual SDGs. In particular, you need to add call edges from the call sites tothe invoked method entry node, parameter-in edges from the actual parameters to the formalparameter nodes, and parameter-out edges from the return value ($ret) to the node where theresult is used or from the fields of objects that constitute a side-effect. 3. Add Summary Edges that summarize the effect of parameters on the result. Any summary edgesymbolizes a parameter that has a directed path from its parameter edge to the return value ofthe respective function invocation. b) Determine the 2-phase (context-sensitive) slice of the second call to println(o.get()). Which nodesare marked in the first phase, which in the second?

See briefly the differences between active and passive transformations.

Write a function two in Scheme that takes a single parameter, a list of integers. The function tworeturns #t if the list of integers includes two equal integers. Otherwise, it returns #f. The list L isflat, i.e., it does not contain sublists.