ALGORITHM Binary(n) //Input: A positive decimal integer n  //Output: The number of binary digits in n's binary representation  count ←1  while n > 1 do  count← count + 1   n← [?/2] ?????? count

import stdio import sys n = int (sys. argv [1]) x=0 i=1 while i <= n: if i % 2 == 0: x += 1 i to 1

The number of element comparisons in Lomuto’s algorithm are a. n+1 b. n-1 c. n/2 d. 1

Python Edit the racquetball game so that all user input is validated # rball.pyfrom random import randomdef main(): printIntro() probA, probB, n = getInputs() winsA, winsB = simNGames(n, probA, probB) printSummary(winsA, winsB)def printIntro(): print("This program simulates a game of racquetball between two") print('players called "A" and "B". The abilities of each player is') print("indicated by a probability (a number between 0 and 1) that") print("the player wins the point when serving. Player A always") print("has the first serve.")def getInputs(): # Returns the three simulation parameters, the prob. that either player wins a serve should be in-between 0 and 1 a = eval(input("What is the prob. player A wins a serve? ")) b = eval(input("What is the prob. player B wins a serve? ")) n = eval(input("How many games to simulate? "))#the number of games should be an integer return a, b, ndef simNGames(n, probA, probB): # Simulates n games of racquetball between players whose # abilities…