Assume you have an array of numbers, where each value occurs at most twice. We consider sums of contiguous numbers in the array. But we only consider such sums whose two endpoints have the same value. The sum includes the two equal values themselves. So if the two equal numbers are at index i and index j(i < j) in array A, then we sum all the values A[i], A[i 1], . . . , A[j].

Abucket of paint has spilled on a tile floor. the paint flow can be expressed with the function p(t) = 6(t), where t represents time in minutes and p represents how far the paint is spreading. the flowing paint is creating a circular pattern on the tile. the area of the pattern can be expressed as a(p) = 3.14(p)^2 part a: find the area of the circle of spilled paint as a function of time, or a[p(t)]. show your work. part b: how large is the area of spilled paint after 8 minutes? you may use 3.14 to approximate pi in this problem.