Write a java program that reads a bank saving account balance and an interest rate and give the output of the account in 5 years and show the amount of the composited account of (1) first yearly, the interest is added once per year at the end of the year. (2) When monthly,

the interest is added 12 times per year, for example if the rate is 8 annually, monthly will be 8/12 and (3) When daily, the interest is added 365 times per year, so if the rate is 8 annually, daily will be 8/365. You do not have to worry about leap years; assume

that all years have 365 days

Your program should have also an outer loop that allows the user to run it again for a new balance and interest rate. The program should be ask the user (“do you want to run it again, enter y/yes for yes or n/no for no ”)

Enter balance from the keyboard
Enter interest from the keyboard
Calculate the composite the value of the composited amount
Yearly the loop should run 5 times
Monthly the loop should run 60 times (5*12)
Daily the loop should run 1825 ( 5*365)
Hint

Formula

balance = balance + (interestRate/100) * balance

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

Alook-up table used to convert pixel values to output values on a monitor. essentially, all pixels with a value of 190 or above are shown as white (i. e. 255), and all values with a value of 63 or less are shown as black (i. e. 0). in between the pixels are scaled so that a pixel with a value p is converted to a pixel of value 2/127 −+3969). if a pixel has a value of 170 originally, what value will be used to display the pixel on the monitor? if a value of 110 is used to display the pixel on the monitor, what was the original value of the pixel?

The narrative structure of the popular movies can be broken down into