Answered step by step
Verified Expert Solution
Question
1 Approved Answer
please do this in assembly language for x86 using c++ thank you!! I will rate you up if you do it right! Problem 6: The
please do this in assembly language for x86 using c++ thank you!! I will rate you up if you do it right!
Problem 6: The exclusive Sweet Potato Pie Society is planning g its annual Harvest Dinner. There will be 3 tables; one will be headed by the Society president, one by the Society treasurer, and one by the Society secretary Mary Marchmount, president, wants to honor those members who give the most money and effort to the Society. She wants those members who give the most money in dues AND who have served as an officer in the past to sit at the head table with her There are 15 members. On all the Society's lists of members, the member number is the place on the list, and the member numbers start at zero. So the third member on the list is member 2 One list of members shows the membership level which is in the range of 1,2,3,4 with 4 being the highest level and require the largest dues payment. MemberLvl 1,3,3,4,2,4,0,1,4,2,1,4,2,2,3 Another list shows whether the member has ever been an officer and which was the last or current position held. Secretary is denoted by 1; treasurer is denoted by 2; president denoted by 3. The members currently holding office are denoted by adding 10 to the officer number. Therefore President Marchmount's entry is 13. OfficerLst 0,13,0,0,2,12,0,1,0,3,2,1,11,0,1 Using assembly, find from these 2 lists Society members who have both level 4 membership and have been at some time an officer, but who are not now officers. Display all the member numbers of the people who fit this criteria. You my use C for the data declaratioins and the outputStep by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started