this interactive problem the difference easy hard version limit number questionsThere n player label 1 n it guarantee n multiple 3among k impostor nk crewmate the number impostor k give it guarantee fracn3 k frac2n3In question choose distinct integer b c 1 le b c le n ask among player label b c impostor crewmate you give integer 0 impostor crewmate 1 otherwisefind number impostor k index player impostor ask 2n questionsThe jury adaptive mean index impostor fix depend question it guarantee set impostor fulfill constraint answer question time