You have two positive integers an and b.    You can perform two sorts of tasks:    a=⌊ab⌋ (supplant a with the integer part of the division among an and b)    b=b+1 (increment b by 1)    Track down the base number of activities needed to make a=0.    Input

Python Algorithm Question (similar to celebrity Python problem). Having trouble implementing the algorithm. Here's the question: Let’s say you’re going to invite some people to a party. You’re considering n friends, but you knowthat they will only have a good time if each of them knows at least k others at the party. (Assume that if A knows B, then B automatically knows A.) Solve your problem by designing an algorithm for finding the largest possible subset of your friends where everyone knows at least k of the others, if such a subset exists.   To help you get started I’ve made a graph of “my friends”: G={'Rachel':['Ross','Monica'], 'Ross':['Rachel','Monica'], 'Monica':['Rachel','Ross'], 'Jon Snow':['Daenerys','Sansa','Arya'], 'Daenerys':['Jon Snow','Sansa','Arya','Khal Drogo'], 'Sansa':['Jon Snow','Daenerys','Arya'], 'Arya':['Jon Snow','Daenerys','Sansa'], 'Khal Drogo':['Daenerys'], 'Cersei':['Jaime'], 'Jaime':['Cersei'], 'Bart':['Milhouse'], 'Milhouse':['Bart','Lisa'],…

Help me with this zybook problem using JavaScript