There are two teams: Home $($H$),$ and Away $($A$).$ Reset switch can be used to start the game. The current score for each team will be shown on two display segments starting with $00.$ Each team will be given $5$ seconds in order to try scoring points. A countdown will appear on display segment $4$ starting from $5$ reaching to $0.$ The two teams cant play simultaneously. H plays first then A gets the turn then H again. When it is team H turn, LEDR$1$ will be on and LEDR$2$ will be off. On the other hand, when it is team A turn, LEDR$2$ will be on and LEDRR$1$ will be off. In each attempt, the team may score $0,1,2,$ or $3$ points. The attempt score will be inserted by turning on one of the score switches for that team. For example, team H inserted score can be $0,1,2,$ or $3$ by turning on sw$1,$ sw$2,$ sw$3,$ or sw$4,$ respectively. In the same way, team A points can be inserted during it attempt through switches sw$5,$ sw$6,$ sw$8,$ or sw$9.$ Each attempts scored points will be added to the teams total score. Team H score will be shown using displays $0$ and $1$ while team A score will be shown using displays $2$ and $3.$ If the countdown ends before inserting a score, the turn will simply move to the other team. Please note that turning on a score switch for a team outside its attempt time wont be counted and its score will not be changed. In this project you can consider that the maximum score any team can reach is $15.$ During the game, LEDG$1$ will be $1$ if team H is winning while LEDG$2$ will be on if team A is winning. If the result is a tie, both LEDS go off. We assume that the user may switch on one score switch only during each attempt. You may need to use the clock from experiment $8$ in order to calculate the required delays. Example: The user turns on the reset switch and both teams start with $00$ score with both LEDG$1$ and LEDG$2$ are off. The first attempt is given to team H and the countdown display will count from $5$ to $0$ while LEDR$1$ is on$.$ During the countdown sw$3$ will be turned on and two points will be added to the team H score to be $02.$ Moreover, LEDG$1$ will be on as team H is winning. Next, the turn goes to team A and hence the countdown display starts counting again from $5$ to $0$ with LEDR$1$ goes off and LEDR$2$ goes on$.$ A$3$ sw$9$ is turned on before the countdown ends. As a result, three points will be added to team A score to become $03.$ LEGR$2$ will be on and LEDG$1$ will be off as team A is winning. The attempt is now returns to team H$.$ However, the countdown reaches $0$ while no score switch is turned on$.$ As a result, the score will not change and the attempt goes back to team A$.$ Modify the code based on this explanationmodule segdriver$($A$,$B$,$C$,$D$,$a$,$b$,$c$,$d$,$e$,$f$,$g$)$;input A$,$B$,$C$,$D;output a$,$b$,$c$,$d$,$e$,$f$,$g;assign a$=($~B&~C&D$)|($B&~C&~D$)$;assign b$=($B&~C&D$)|($B&C&~D$)$;assign c$=($~B&C&~D$)$;assign d$=($~B&~C&D$)|($B&~C&~D$)|($B&C&D$)$;assign e$=$D$|($B&~C$)$;assign f$=($~B&D$)|($~B&C$)|($C&D$)$;assign g$=$~A&~B&~C;endmodulemodule counter $($input clock, output reg$[31$:$0]$ counter$\_$out$)$;always @ $($posedge clock$)$begincounter$\_$out $<=$ #$1$ counter$\_$out $+1$;endendmodule module dff$1($D$,$Reset,clk$,$Q$,$Qnot$)$;input D$,$clk$,$Reset;output Q$,$Qnot;reg Q$,$Qnot;always @ $($posedge Reset, posedge clk$)$beginif $($Reset$)$beginQ $<=0$;Qnot $<=1$; endelsebeginQ $<=$ D;Qnot $<=$ ~D;endendendmodulemodule dmux$1$to$2($o$0,$o$1,$s$,$in$)$;output o$0,$o$1$;input s$,$in;$//$Invgate $($out$,$in$1)$;Invgate $($w$1,$s$)$;$//$Andgate$2($out$,$in$1,$in$2)$;Andgate$2($o$0,$w$1,$in$)$;Andgate$2($o$1,$s$,$in$)$;endmodulemodule dumux$1$to$5($d$,$s$0,$s$1,$s$2,$o$0,$o$1,$o$2,$o$3,$o$4,$o$5,$o$6,$o$7)$;input d$,$s$0,$s$1,$s$2$;output o$0,$o$1,$o$2,$o$3,$o$4,$o$5,$o$6,$o$7$;$//$dmux$1$to$2($o$0,$o$1,$s$,$in$)$; dmux$1$to$2($w$0,$w$1,$s$2,$d$)$; dmux$1$to$2($w$2,$w$3,$s$1,$w$0)$; dmux$1$to$2($w$4,$w$5,$s$1,$w$1)$;dmux$1$to$2($o$0,$o$1,$s$0,$w$2)$; dmux$1$to$2($o$2,$o$3,$s$0,$w$3)$;dmux$1$to$2($o$4,$o$5,$s$0,$w$4)$;dmux$1$to$2($o$6,$o$7,$s$0,$w$5)$;endmodulemodule Andgate$2($out$,$in$1,$in$2)$;input in$1,$in$2$;output out;assign #$1$ out$=($in$1$&in$2)$;endmodulemodule Andgate$3($out$,$in$1,$in$2,$in$3)$;input in$1,$in$2,$in$3$;output out;assign #$1$ out$=($in$1$&in$2$&in$3)$;endmodulemodule Nandgate$3($out$,$in$1,$in$2,$in$3)$;input in$1,$in$2,$in$3$;output out;assign #$1$ out$=$~$($in$1$&in$2$&in$3)$;endmodulemodule Andgate$4($out$,$in$1,$in$2,$in$3,$in$4)$;input in$1,$in$2,$in$3,$in$4$;output out;assign #$1$ out$=($in$1$&in$2$&in$3$&in$4)$;endmodulemodule Invgate $($out$,$in$1)$;input in$1$;output out;assign #$1$ out$=$~$($in$1)$;endmodulemodule Orgate$3($out$,$in$1,$in$2,$in$3)$;input in$1,$in$2,$in$3$;output out;assign #$1$ out$=($in$1|$in$2|$in$3)$;endmodulemodule Orgate$4($out$,$in$1,$in$2,$in$3,$in$4)$;input in$1,$in$2,$in$3,$in$4$;output out;assign #$1$ out$=($in$1|$in$2|$in$3|$in$4)$;endmodulemodule Orgate$2($out$,$in$1,$in$2)$;input in$1,$in$2$;output out;assign #$1$ out$=($in$1|$in$2)$;endmodulemodule Nandgate $($out$,$in$1,$in$2)$;input in$1,$in$2$;output out;assign #$1$ out$=$~$($in$1$&in$2)$;endmodulemodule Xnorgate $($out$,$in$1,$in$2)$;input in$1,$in$2$;output out;assign #$1$ out$=$~$($in$1^$in$2)$;endmodulemodule Xorgate$3($out$,$in$1,$in$2,$in$3)$;input in$1,$in$2,$in$3$;output out;assign #$1$ out$=($in$1^$in$2^$in$3)$;endmodulemodule Norgate $($out$,$in$1,$in$2)$;input in$1,$in$2$;output out;assign #$1$ out$=$~$($in$1|$in$2)$;endmodulemodule Norgate$3($out$,$in$1,$in$2,$in$3)$;input in$1,$in$2,$in$3$;output out;assign #$1$ out$=$~$($in$1|$in$2|$in$3)$;endmodulemodule Xorgate $($out$,$in$1,$in$2)$;input in$1,$in$2$;output out;assign #$1$ out$=($in$1^$in$2)$;endmodulemodule mux$2$to$1($I$0,$ I$1,$ S$,$ out$)$;input I$1,$ I$0,$ S;output out;$//$Invgate $($out$,$in$1)$;Invgate $($w$1,$S$)$;$//$Andgate$2($out$,$in$1,$in$2)$;Andgate$2($w$2,$S$,$I$1)$;Andgate$2($w$3,$w$1,$I$0)$;$//$Orgate$2($out$,$in$1,$in$2)$;Orgate$2($out$,$w$3,$w$2)$;endmodulemodule mux$3$to$1($in$0,$in$1,$in$2,$S$0,$S$1,$out$)$;input in$0,$in$1,$in$2,$S$0,$S$1$;output out;$//$mux$2$to$1($I$0,$ I$1,$ S$,$ out$)$;mux$2$to$1($in$0,$ in$1,$ S$0,$ out$0)$;mux$2$to$1($out$0,$ in$2,$ S$1,$ out$)$;endmodule module mux$4$to$1($in$0,$in$1,$in$2,$S$0,$S$1,$out$)$;input in$0,$in$1,$in$2,$S$0,$S$1$;output out;$//$mux$2$to$1($I$0,$ I$1,$ S$,$ out$)$;mux$2$to$1($in$0,$ in$1,$ S$0,$ out$0)$;mux$2$to$1($out$0,$ in$2,$ S$1,$ out$)$;endmodule module mux$5$to$1($in$7,$in$6,$in$5,$in$4,$in$3,$in$2,$in$1,$ in$0,$ S$0,$S$1,$S$2,$ out$)$;input in$7,$in$6,$in$5,$in$4,$in$3,$in$2,$in$1,$ in$0,$ S$0,$S$1,$S$2$;output out;$//$mux$2$to$1($I$0,$ I$1,$ S$,$ out$)$;mux$2$to$1($in$0,$in$1,$ S$0,$ out$0)$; mux$2$to$1($in$2,$ in$3,$ S$0,$ out$1)$; mux$2$to$1($in$4,$ in$5,$ S$0,$ out$2)$;mux$2$to$1($out$0,$ out$1,$ S$1,$ out$3)$; mux$2$to$1($out$3,$ out$2,$ S$2,$ out$)$; endmodulemodule prayertracker$($Reset$,$clk$,$F$,$D$,$A$,$M$,$E$,$LG$1,$LG$2,$LG$3,$LG$4,$LG$5,$LR$1,$LR$2 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 Recommended Textbook for Professional Microsoft SQL Server 2012 Administration Authors: Adam Jorgensen, Steven Wort 1st Edition 1118106881, 9781118106884 More Books Students also viewed these Databases questions Question ★★★★★ A ball is tossed from an upper-story window of a building. The ball is given an initial velocity of 8.00 m/s at an angle of 20.0 below the horizontal. It strikes the ground 3.00 s later. (a) How far... Answered: 1 week ago Question ★★★★★ Determine the following indefinite integrals. Check your work by differentiation. (e x + 2 dx Answered: 1 week ago Question ★★★★★ Is the faculty member a member of a professional organization? If so, which one(s)? Answered: 1 week ago Question ★★★★★ Prepare any necessary adjusting entries at December 31, 2015, for Melbourn Companys year-end financial statements for each of the following separate transactions and events. 1. Melbourn Company... Answered: 1 week ago Question ★★★★★ Given an array of size n, take inputs from the user and add them to the array only if they satisfy the following conditions: it is a prime and it is a non-duplicate number. The program stops taking... Answered: 1 week ago Question ★★★★★ Problem 5-2 Presented below are a number of balance sheet items for Martinez, Inc., for the current year, 2017. Goodwill$126,830Accumulated Depreciation-Equipment$292,290Payroll Taxes... Answered: 1 week ago Question ★★★★★ totaling 10 marks. Question 31 2 Points CASE: Noora is against smoking. She has seen how this bad habit can negatively affect health. Noora's father was a smoker, and he died a few years ago because... Answered: 1 week ago Question ★★★★★ 1 8 . 2 . in surveting What are the steps required to provide a vertical location layout for ( a ) a one - story building or ( b ) a multistory building? List the steps in point form Answered: 1 week ago Question ★★★★★ Question 1-9 marks One of the most popular buzzwords in business today is the word "Kaizen". It is a Japanese word meaning "incremental improvement. Kaizen was formalized by the Toyota Production... Answered: 1 week ago Question ★★★★★ As strategic partners, how human resource managers approach change management, based on organizational structure, culture? Also, how knowing different functional areas of an organization (e.g.,... Answered: 1 week ago Question ★★★★★ Per case, Obermeyer s initial production commitment is at least 1 0 , 0 0 0 units. To get some more understanding, we\'ll change this slightly, to 1 2 , 0 0 0 units. Which styles should be produced... Answered: 1 week ago Question ★★★★★ 3.17 A department store manager has monitored the number of complaints received per week about poor service. The probabilities for numbers of complaints in a week, established by this review, are... Answered: 1 week ago Question ★★★★★ 3.16 If two events are mutually exclusive, we know that the probability of their union is the sum of their individual probabilities. However, this is not the case for events that are not mutually... Answered: 1 week ago Question ★★★★★ 3.14 On a sample of 1,500 people in Sydney, Australia, 89 have no credit cards (event A), 750 have one (event B), 450 have two (event C) and the rest have more than two (event D). On the basis of the... Answered: 1 week ago Previous Question Next Question View Answer in SolutionInn App Services Sitemap Fun Definitions Become Tutor Study Help Categories Recent Questions Expert Questions Company Info Security Copyrights Privacy Policy Terms & Conditions SolutionInn Fee Scholarship Get In Touch About Us Contact Us Career Jobs FAQ Campus Ambassador Secure Payment Download Our App © 2024 SolutionInn. All Rights Reserved $