Description
Write a Lisp program that generates a list containing all legal successor states for any state in the Missionaries and Cannibals problem. Your program should be invoked by the function call:
(mac-next state)
where state is of the form (m,n,b), with m representing the number of missionaries (0-3) on the left bank, n representing the number of cannibals (0-3) on the left bank, and b representing whether the boat is on the right side (r) or the left side (I) of the river.
For example:
(mac-next (33I)) => ((22r) (32r) (31r))
(mac-next (31r)) => ((32I) (33l))
(mac-next (33r)) => nil
Your function should check whether the inputted state is in the proper format. If not, an error message should be displayed instead of the list of successor states.
![Read both part Q4(a), Q4(b), and Q4(c) before attempting the question. You can submit part Q4(a), Q4(b), and Q4(c) together. Question 4a Create and write a function countRepeatingChar(word: string): int, that returns the highest number of the "repeating letter" in the given parameter word. Assume the given parameter word is in lowercase. For example, countRepeatingChar(word) returns these values for the following words as parameters: - assistants 4 - that 2 - business 3 - count 1 Write a function initializeDictionary(filename: string): dictionary, that reads the words from the given filename and returns the dictionary in the following format: stats={4:[assistants],2:[that,function,repeating,letters],3:[repeated,suss,business,assist],1:[count,word]} The key is the number of the "repeating letters", and the value is a list of words. Content of the file will be words separated by space. Each line may contain one or more words (all in lowercase). Example of a sample input file content: For each of the word read, find the highest number of the "repeating letter" for this word. Use this number as the key to the dictionary, to either build the list or append the word into the list. (13 marks) Create and implement a main function that calls the initializeDictionary function, and write selected content of the dictionary into another file, in this order and format: - ignore words that have no repeating letter, i.e., those words with key = 1 - in ascending order of the number of "repeating letters", followed by the list of words that have this number of repeating letters Sample output file: 2: that function repeating letters 3: repeated suss business assist 4: assistants (9 marks)](https://gotit-pro.com/wp-content/uploads/2023/10/fb9078e3-f478-4b1e-8d70-42a108dcfb18.jpg)
![5. Write a program that implements a class called MyTeam. Your class should have the following private data items: Id (int), Name (string), Slogan (string), Wins (int), and Losses (int). You need to define properties with appropriate accessor functions for each of the data items. Methods should include a default constructor that sets values to the empty string or zero, a constructor that allows the user to specify all values for the data items, a member method called DisplayTeamInfo that outputs all the information for the given toy in a reasonable format. Challenge Problem: Code your set accessors to restrict all numeric fields (Id, Wins, Losses) to positive numbers. You can determine how you want to report/respond to the error. (25 pts) The code below is my suggestion for your Main() method for Program 22 static void Main(string[] args) { MyTeam myHitchhikers = new MyTeam(); myHitchhikers.Id = 42; myHitchhikers.Name = "Ford Prefect et. al."; myHitchhikers.Slogan = "Don't panic!"; myHitchhikers.Wins = 525; myHitchhikers.Losses = 42; Console.WriteLine("nTeam 1 Information"); myHitchhikers.DisplayTeamInfo(); MyTeam mykitties = new MyTeam(); Console.WriteLine("nTeall 2 Information"); mykitties.DisplayTeamInfo(); MyTeam myPatriots = new MyTeam(2023, "UC Patriots", "One Big Team", 42, 3); Console.WriteLine("nTeam 3 Information"); myPatriots.DisplayTeamInfo(); //This will test your Challenge Problem Settings if you attempted them Console.WriteLine("nTeam 4 Information"); MyTeam mywinners = new MyTeam(13, "Winners", "We like to win more than you do", -20, -35); } myllinners.DisplayTeamInfo();](https://gotit-pro.com/wp-content/uploads/2023/10/3e8c6678-946b-46ed-9c20-1515f2ff356a-324x229.png)
Tangela Arnwine –
Tutor wrote it quickly and effectively. Great solution.
David Leedberg –
Second time coming to this website for a paper and it worked out great.