Another gray seal, Gracie, has also been tracked recently, using a tracking microchip attached to her flipper. This allows scientists to track her movement in the ocean to see her exact location. The following lines of code represent the latitude and longitude of Gracie's
location over time.
lat - [40.59, 40.52, 40.621, 40.519, 40.56, 41.265, 40.61, 40.806, 41.259, 41.265, 41.264, 41.264, 41.259, 41.262, 41.263]
lon = [69.532, 69.419, 69.354, 69.263, 69.478, 79.885, 69.706, 78.331, 70.815, 78.823, 70.815, 78,81, 78.824, 79.811, 70.811]
The lat list indicates how far north and south Gracie the seal has traveled, and the long list represents how far east and west she has
traveled. The larger the latitude value, the further north the seal was located, and for this area of the world, the larger the longitude
value, the further west the seal is located.
Write a program to calculate the farthest in each direction that Gracie was located throughout her travels. Add four print statements to
the lines of code above that output the following, where the number signs are replaced with the correct values from the correct list:
Farthest north - #
Farthest west #
Farthest south - #
Farthest east =#

Some of your friends have gotten into the burgeoning field of time-series data mining, in which one looks for patterns in sequences of events that occur over time. purchases at stock exchanges"what's being bought" are one source of data with a natural ordering in time. given a long sequence s of such events, your friends want an efficient way to detect certain "patterns" in them"for example, they may want to know if the four events buy yahoo, buy ebay, buy yahoo, buy oracle occur in this sequence s, in order but not necessarily consecutively. they begin with a collection of possible events (e.g., the possible transactions) and a sequence s of n of these events. a given event may occur multiple times in s (e.g., yahoo stock may be bought many times in a single sequence s). we will say that a sequence s is a subsequence of s if there is a way to delete certain of the events from s so that the remaining events, in order, are equal to the sequence s . so, for example, the sequence of four events above is a subsequence of the sequence buy amazon, buy yahoo, buy ebay, buy yahoo, buy yahoo, buy oracle their goal is to be able to dream up short sequences and quickly detect whether they are subsequences of s. so this is the problem they pose to you: give an algorithm that takes two sequences of events"s of length m and s of length n, each possibly containing an event more than once"and decides in time o(m + n) whether s is a subsequence of s.

Assume that to_the_power_of is a function that expects two int parameters and returns the value of the first parameter raised to the power of the second parameter. write a statement that calls to_the_power_of to compute the value of cube_side raised to the power of 3 and that associates this value with cube_volume.

Asecurity policy is a a. set of guidlines b. set of transmission protocols c. written document d. set of rules based on standards and guidelines