You are given a sorted circular linked list containing n integers, where every element has a "next" pointer to the next larger element. The largest element's "next" pointer points to the smallest element.) You are asked to determine whether a given target element belongs to the list. There are only two ways you can access an element of the list: (1) to follow the next pointer from a previously accessed element, or (2) via a given function RAND that returns a pointer to a uniformly random element of the list. Develop a randomized algorithm for finding the target that makes at most O(Vn) comparisons in expec- tation and always returns the correct answer. Hint: Your algorithm will perform some random accesses and some amount of linear search. Use part a) to analyze the number of steps in the linear search.)

Part a what is the area of triangle i? show your calculation. part b triangles i and ii are congruent (of the same size and shape). what is the total area of triangles i and ii? show your calculation. part c what is the area of rectangle i? show your calculation. part d what is the area of rectangle ii? show your calculation. part e rectangles i and iii have the same size and shape. what is the total area of rectangles i and iii? show your calculation. part f what is the total area of all the rectangles? show your calculation. part g what areas do you need to know to find the surface area of the prism? part h what is the surface area of the prism? show your calculation. part i read this statement: “if you multiply the area of one rectangle in the figure by 3, you’ll get the total area of the rectangles.” is this statement true or false? why? part j read this statement: “if you multiply the area of one triangle in the figure by 2, you’ll get the total area of the triangles.” is this statement true or false? why?