Homework 1 Problem 1: (requires a two dimentional array) A company has 5 salespeople (numbered 1 to 5) who sell five different products (numbered 1 to 5). Once a day, each salesperson passes in a slip for each different type of product sold. Each slip contains the following information: - the salesperson I.D. number (1, 2, 3, 4 or 5) - the product number (1, 2, 3, 4 or 5) - the total dollar value of that product sold that day. That is, each salesperson passes in between 0 and 5 sales slips every day. Assume that the information from the slips for the last month is available. Write a program that will read it and summarize the total sales by salesperson by product. All totals should be stored in a two-dimentional array, called sales. After processing all the information for the last month, print the results in a tabural format with each of the columns representing a particular salesperson, and each of the rows representing a particular product. Cross total each row to get the total sales of each product for the month; cross total each column to get the total sales by salesperson for last month. Your tabular printout should include these cross totals to the right of the totaled rows and to the bottom of the totaled column. Problem 2: Design and implement a class Card that represents a standard playing card. Each card has a suit and a face value. Next, create a class called DeckOfCards that store 52 objects of type Card. This class must include: the shuffle method, which shuffles the deck; the deal method, which deals with a card from the deck (returns the card on the top of the deck); and the report method, which reports the number of cards left in the deck. Finally, create a driver class that deals each card from a shuffled deck, printing each card as it is dealt. Include extensive comments in your programs explaining the goal of each method and class. Use BlueJ to develop and test your programs. Submit your homework in a named folder, containing all charts, files, test cases, etc. as explained in the course outline.