You will be creating just a single web page in which you are to accomplish a series of small tasks demonstrating familiarity with basic string and array functionality. Have a button that says ‘Detect My Browser’. When the user clicks the button, let them know which browser they are using. As you will have seen in lecture, browser names are not always intuitive. For example, Internet Explorer typically includes the characters ‘MSIE’. For this part, you may assume that the following characters will be present:For Firefox, the string "Firefox" will be presentFor Chrome , the string "Chrome" will be presentFor Safari, the string "Safari" will be presentIf the user is not using any of the above browsers, you can simply output as your result: "You are not using one of the more common browserNote: I am leaving out Internet Explorer as detection involves a certain amount of extra coding that will cause you more time and effort than it is worth. You will, of course, need an if/else-if block for this part. Part 2Have 3 text boxes in which the user enters three numbers. Then have a radio button in which you offer them the option of finding the product, the average, or the sum of the three numbers. When the user selects an option, you should output the result of their choice to a ‘results’ div section at the bottom of your page. You MUST store the numbers inside an array. That is, you may not use separate variables to store the three numbers.

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 even~s--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

During physical science class ben and jerry connected three identical lightbulbs in parallel to a battery where happens when ben removes one of the lightbulbs from it’s socket

Research data that is presented using descriptive language is said to be