2. Cirratest summon divers. Write a propram Divisocs - jore io compute the pratest comeno divibor and nelated fenctions ou inegen: a The grvatcat comrowe divirar igodf of bwo iategens a and be is the largeat poritive intoger thut as a diviose of boch g anal b. For cample, gotit40, (+98)=24 becauec 24 is a diviser of bod 1440 and 405 ? covention, grof(0,0)=0 positive integer that is a mulhiple of bect a and b. For chanple, kai56. 98) =672 becaese 672 is a maluple of beth 56 and 96(672=5612=967) but mo smaller poicive mumber is a maltiple of hoth 11 cemention, if cither a oe b is 4 , those lem2(a,b)=0 - Two incegers are nitavely prine if they sture no positive cunmon divisies (other dhan 1). Fot cxample, 221 asd 354 ant sof sclatively prime becane 17 is a corranon divinet. a Eaker i hoien fansioe (n) is the menter of thegens between I atal n the 1,2,4,5,7, and $ are eclatively prime with 8 . Note that if n0, then (s)=0, To do wh, organizs your program accondite to the following fublic API: public elun otvisors \& gublie otatie int pedilint a, int b) publie wathe iat tenilist as int b) gublie osacie bedan arehedatinedrprike(ins a, ist by publie atanie int tatiens(int n) Use the following algorithans so ierplenten the conergoediag tunctient. - Givilest sammie divior limpleinent an itcrative vorios af Ewcllal a mporitis. To contapate the greateat counton divisur of a and 6 : - Replase (a,b) with (a,b). - Repeatedf seplace (a,b) with (b,a)$b) antil the socond inteper in the puir is asto. - Retum the fins iaceger it the pair as the god. - Lavi comman maityde. Use the followaing formula, a hich selates ile goil afal kon Hention: To avod procreatic arithenefic overthos, porform the divason hogror the maltipliowion Recall that dem(0,0)=0. - Rolamed prime. Two isicpen and b afe felativily prime if aad oely if gnd (a,b)=1 - Raler 3 hwirar faerwan Use the definition aral call 6. The zrcafert cammor divikir findy of two integers g and 6 is the lerpet proitive imeger that is a divisir of theth is and b. Fur nample, 20 . 1440. 408 ) 24 because 24 is a divisar of both 1440 and 468 ( 1440=2460,403=2417) but no larger intrger is a divisar of both. By cenvemion, godl 0,00)=0. 672 becmost 672in a multiple of boeb 56 and 96 (672 - 5612967) a or b is , then lem(a2a)=0. - Two indegers are nilarivly grime if they share wo pesitive common divisars is a cenmin diviver. a. Eube ? hufion firnction (n) in Be number of integen betwoen 1 and n that i,2,4,5,7, anal 8 are celativity prime aith 9 . Nose thut if 50 , then (n)=0. Tade so, ongatine your program acoovding to the follewing publes APt: publie elass pirisers 1 pabile otosie int getist on int b) publie statie iat leatiat on, iat by pablie otatie boelean arofidativeligriastiet a, int b) pabibe otande int totientint of publie statie noid nuis(stringtl argo) Here are rtae sariple cuccetions: ) Ginetcar coaseun diviser, fmplement as inenah we versice of Eividi? algorichei. To cempent the peiken coennot divitor of a and b: - Roplack (e,B) with (a,N,N). - Bepaatedly toplace (a,B) with (b, in 5) until the secast iateser in the puir an atre. - Rotern the firsi inlegor in the puir as fles goll. formala, whinh rolates the gral and kn= functicea: imien=min1max To avoid prevemble aritunetic werflos; perfons the dobiaion /opfore the multiplication. Rerall dat lerw (0,0)=a o Rrianidy prime. Tue integers a and ef are scluevidy grime if and only if gd(a,b)=1. = Evilr k astiont funchion. Use the drficitioo and call arepelativelyprine i 3 for carh potitive inityoir botwock t and a