Recall the eStore exercise we developed in a previous exercise. In this exercise we

want to do some analysis of the performance of this eStore for the particular case of the search function. We will simplify the problem further and we assume that that the objects instantiated are:

$1.$ A user of class User.

$2.$ A website of class Website.

$3.$ A database of class Database.

Assume the following table of key functions: Turn in the following:

$1.$ A sequence diagram showing how the search is conducted between the three different objects. The user can instantiate three types of searches: $(1)$ keywordSearch, $(2)$ isbnSearch, or $(3)$ authorNameSearch.

$2.$ From the sequence diagram create a search execution model diagram and assign demand weights.

$3.$ Assign probabilities for the search paths. You choose, but there is a constraint. What is it$?$

$4.$ Calculate worst, best and average calculation times. Table $5\mathrm{.}1$: Service Demands

$\backslash$begin$\{$tabular$\}\{|$l$||$r$|$r$|$r$|\}$

$\backslash$hline Processing Step & $2$x CPU & $1$x I$/$O & $1$x Network $\backslash \backslash$

$\backslash$hline OpenPage$()$ & $30$ & $2$ & $1\backslash \backslash$

getCriteria$()$ & $1030$ & $3$ & $1\backslash \backslash$

keywordSearch$()$ & $20000$ & $0$ & $0\backslash \backslash$

isbnSearch$()$ & $0$ & $0$ & $0\backslash \backslash$

authorNameSearch$()$ & $0$ & $0$ & $0\backslash \backslash$

getBooks$()$ & $0$ & $0$ & $0\backslash \backslash$

displayResults$()$ & $30$ & $2$ & $1\backslash \backslash$

$\backslash$hline Times $($ms$)$ & $\mathrm{.}001$ & $\mathrm{.}02$ & $\mathrm{.}1\backslash \backslash$

$\backslash$hline

$\backslash$end$\{$tabular$\}$