Create a MIPS program that fulfills the following specifications: 1. use the dialog syscall (#54) to input a string from the user 2. call a function which counts the number of characters and number of words in the string and returns these in $v0 and $v1; store these in memory 3. output (console) the string and counts to the user (see example below) 4. repeat from 1 until the user enters a blank string or hits "cancel" 5. additionally, use $s1 somewhere in your function so that you must save it on the stack at the top of your function and restore it before the function exits; Of course this function could be written without using an s register, but this is good practice in using the stack. 6. output a dialog message (syscall #59) to say goodbye before the program ends

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.

Elements such as fonts colors visual structure graphics and the interface of a web page should complement each other to ensure blank

List a few alternative options and input and output over the standerd keyboard and monitor. explain their functioning in details.