• • Write a Python function called integer_set(n) that takes as input a nonzero positive integer
    n and returns a set with all the digits of n (without repetitions).

    # testing Question
    integer_set(111)
    {1}
    integer_set(1212)
    {1, 2}
    integer_set(1234)
    {1, 2, 3, 4}
    integer_set(78978)
    {8, 9, 7}
    integer_set(1010)
    {0, 1}

  • 
    

 

 

Answer rating: 100% (QA)

def integersetn This function takes a nonzero positive integer n and returns a s... View the full answer