$1.(20$ points$)$ The blackboard architectural style is a way of decomposing complex problems into smaller, more manageable subproblems. The idea is to create a central "blackboard" that can be accessed by multiple subproblems, which can then share information and collaborate to find a solution. This style allows the problem to be divided into smaller pieces, which can be solved independently and then combined to find a solution to the overall problem. Implement the well known Quicksort algorithm, a famous divide and conquer technique to sort large sequences of comparable values, via the Blackboard style.

Guidance on implementation: You should follow the following approach during your implementation:

Define a class to act as the Blackboard, i$.$e$..$ maintaining the shared state and data of the application $($the collection of values to be sorted, and any operations to be carried upon those values, like partitioning, comparing, exchanging, etc.$)$

Define other classes for other tasks in your program; reading the input data and storing that onto the blackboard, partitioning the blackboard according to the Quicksort partitioning scheme, sorting the data with the Quicksort algorithm, etc.

A public class $($mysort$.$java$)$ which holds the main method to coordinate the actions of your other components on the Blackboard. For the sake of simplicity, you can assume that the components will not operate concurrently on the Blackboard, but will carry out their responsibilities sequentially, under the control and coordination of the main method.

Test your program to sort some words $($at least a few tens of strings$)$ in alphabetical order.

$1.(20$ points$)$ Write a pipe$-$and$-$filter application, in Java programming language, that prints a sorted list of every unique word in a given text file. That is$,$ each unique word should appear only once on the output. You should come up with at least three filters, one to eliminate the punctuation characters $($each punctuation should be replaced with the space character$)$ from the input file, the second one to find and extract the unique words from the extracted and replaced text, and the last filter to sort those unique words, and print the output to the console.The input to the application should be the name of the text file to be processed, and

the output should be the sorted list of unique words in the file. You are expected to

use the Java program you have written for question $1$ above as the last filter in the

chain.

Assuming that you have given "eliminate", "unique$\_$words", and "mysort" to your

individual filters, your overall application should be executed by giving the following

command on the command line:

$"\backslash \%$ java eliminate $""$ java unique$\_$words $""$ java nysort $"$

You can test your application with the sample text file provided together with this

homework assignment pack.

$(10$ points$)$ Model the static aspects $($from logical$/$structural viewpoint$),$ and the

dynamic aspects $($from a behavioral viewpoint$)$ separately, of the above mentioned

software system with, either:

a$.$ UML $($class diagrams not required$)$; two separate models, one for static aspects

$($logical$/$structural viewpoint$),$ one for dynamic aspects $($behavioral viewpoint$)$

or;

b$.$ C$4($code level not required$)$; two separate models, one for static aspects

$($logical$/$structural viewpoint$),$ one for dynamic aspects $($behavioral viewpoint$)$

Please submit your deliverable for the assignment as a single $".$ qip" file via the Blackboard

system, under the following file naming scheme:

Late Acceptance Policy: Late submissions after the deadline will not be accepted.

Good luck.