Math 221 Discrete Mathematics UOPX I need week 5 help Questions are listed below Make sure all of them are fresh work with proper citation APA format; no used work will be accepted thanks so much. ONLY Highlighted in Yellow Questions need to be answer. I need Help on my Discrete Math 221 for University of Phoenix Week 4 and Week 5 please take a look at my attachment I need week 4 class participation and on week 4 I need class participation, on Individual Assignment word 800-1250 essay assignments and student connect solutions. Please take a look its very small work not much. Book Name: Discrete Mathematics and Its Applications ,Seventh Edition by Kenneth Rosen instructor name: stephen wiitala for University of Phoenix Make sure while you write any of those answer please use it proper citations as you can see above red lines from my instructor he is very restrict about citations, I request you to read that and follow his instructions thanks so much. Week5 Applications of Discrete Mathematics Class Discussions:- 4 questions Question 1: Solutions to Practice Problem 1 Practice Problem (1) on Counting Techniques There are four practice problems available for you to discuss this week. They focus on content from all four of the previous week of the course. Use these problems to test your readiness for the Final Exam. Towards the end of the the week, I will post solutions to the problems. Your responses in this discussion do count for participation credit Suppose you are organizing a business meeting and are in charge of facilitating the introductions. A. Suppose there are 5 people in the group 1.How would you arrange the group so each person can shake hands with every other person? 2. How many times will each person shake hands with someone else? 3. How many handshakes will occur? B. Suppose there is an unknown number (n) people in the group 1.How would you arrange the group of n people so each person can shake hands with every other person? 2. How many times will each person shake hands with someone else? 3. How many handshakes will occur? This answer should be expressed as a general counting formula that depends on the value of n. Question 2: Solutions to Practice Problem 2 Practice Problem (2) on Logic There are four practice problems available for you to discuss this week. They focus on content from all four of the previous week of the course. Use these problems to test your readiness for the Final Exam. Towards the end of the week, I will post solutions to the problems. Your responses in this discussion do count for participation credit Use a truth table or Venn diagram to show that the statement p v (q ^ r) is equivalent to (p v q) ^ (p v r) Show that this statement is not equivalent to (p v q) ^ r. Be sure to explain your answer and don't just provide a truth table or Venn diagram. Why does your table or diagram verify the result? Question 3:- Solutions to Practice Problem 3 Practice Problem (3) on Relations There are four practice problems available for you to discuss this week. They focus on content from all four of the previous week of the course. Use these problems to test your readiness for the Final Exam. Towards the end of the week, I will post solutions to the problems. Your responses in this discussion do count for participation credit Define the following relation on the set of positive integers xRy if x - y is an even integer 1. Show that R is an equivalence relation. With an equivalence relation, the set on which the relation is defined is divided into subsets called equivalence classes. These subsets consist of all elements that are equivalent to each other. The equivalence class of 1, denoted by [1] consists of all elements that are equivalent to 1 under the relation. 2. How many distinct equivalence classes are there in this example? Can you describe the sets? Question 4:- Solutions to Practice Problem 4 Practice Problem (4) on Tree Traversal Algorithms There are four practice problems available for you to discuss this week. They focus on content from all four of the previous week osf the course. Use these problems to test your readiness for the Final Exam.. Your responses in this discussion do count for participation credit The following algorithm describes a postorder tree traversal Postorder(tree) If left subtree exists then Postorder(left subtree) If right subtree exists then Postorder(right subtree) Print root end Can you apply that to the following tree + / \\ / \\ * - / \\ / \\ 2 3 * + / \\ / \\ 4 2 1 5 What is the result of the executing the algorithm? In the terminology of Week 3, what kind of algorithm are we considering here? Individual Assignment:- Case Study Application Paper Choose one of the following Case Studies: Food Webs Coding Theory Network Flows Write a 750- to 1,250-word paper in which you complete one of the following options: Option 1: Food Webs Case Study Explain the theory in your own words based on the case study and suggested readings. Include the following in your explanation: Competition Food Webs Boxicity Trophic Status Give an example of how this could be applied in other real-world applications. Format your paper according to APA guidelines. All work must be properly cited and referenced. The correct reference for this source is the following: McGuigan, R. A.. (1991). Food Webs. Retrieved from McGuigan, R. A., MTH221 - Discrete Math for Information Technology website Submit your assignment to the Assignment Files tab. Option 2: Coding Theory Case Study Explain the theory in your own words based on the case study and suggested readings. Include the following in your explanation: Error Detecting Codes Error Correcting Codes Hamming Distance Perfect Codes Generator Matrices Parity Check Matrices Hamming Codes Give an example of how this could be applied in other real-world applications. Format your paper according to APA guidelines. All work must be properly cited and referenced. The correct reference for this source is Rosen, K. H.. (1991). Coding Theory . Retrieved from Rosen, K. H., MTH221 - Discrete Math for Information Technology website. Submit your assignment to the Assignment Files tab. Option 3: Network Flows Case Study Explain the solutions for examples 1, 2 and 3 from the text. Explain the theory developed including capacitated s,t graphs and the lexicographic ordering rule based on the case study and suggested readings. Give an example of how this could be applied in other real-world applications. Format your paper according to APA guidelines. All work must be properly cited and referenced. The correct reference for this source is: Hobbs, A. M. (1991). Network Flows. Retrieved from Rosen, K. H., MTH221 - Discrete Math for Information Technology website. Attached PDF file has all three documents for the week 5 case study application paper Supporting documents... Week -5 Food Webs Week 5 Mt Week -5 Mth theory.pdf h221_r3_coding_theory_case_study.pdf 221_r3_network_flows_case_study.pdf There are 2 individual assignments on week 5, I only have one information so far and that is above listed and waiting for the other one. He is using this book Discrete Mathematics and Its Applications 7e Kenneth H. ROSEN I need week 5 Student connect express solutions please post that before. I will start working on the lab once you give me student connect express solutions. Thanks