Using the new python online tool (see attached link), write a program that contains two files. One file is the main. py and the other file is a support. py Add TWO function definitions to the support. py file ONLY (see video).

One function must calculate the volume of ANY cylinder. You must determine how many arguments you should pass to that function based on the volume formula.

Another function must calculate the volume of ANY pyramid. You must determine how many arguments you should pass to that function based on the volume formula.

Each function must return the results of their calculations to the caller.

Using the import module, call each function in the support. py file from the main. py file and display the results (see video).

Formulas:

Pyramid: v= ⅓* l*w*h
Cylinder: v = 2*PI*r^2*h

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.

The two main ways in which marketers address the competition with their strategies are by satisfying a need better than a competition and by

Which of the following is not contained on the slide show toolbar? a. next button b. slide button c. close button d. pen tool