May I please have some help with the logic in Python for creating the print$\_$all$\_$combinations method per the comments in the method? Note it should not use Python's native itertools but rather the next$\_$combination method.

import collections

class Combination:

def $\_\_$init$\_\_($self$,$ values, subset$\_$len$)$:

set$\_$values $=$ sorted$($set$($values$))$

self.combination$\_$set $=$ list$($set$\_$values$)$

self.subset$\_$length $=$ subset$\_$len

self.current$\_$combination $=$ list$($self$.$combination$\_$set$[$:subset$\_$len$])$

def reset$\_$combination$($self$)$:

self.current$\_$combination $=$ list$($self$.$combination$\_$set$[$:self.subset$\_$length$])$

def get$\_$combination$($self$)$:

return list$($self$.$current$\_$combination$)$

def set$\_$combination$($self$,$ combo$)$:

set$\_$combo $=$ sorted$($set$($combo$))$

if len$($set$\_$combo$)!=$ self.subset$\_$length:

return

for value in set$\_$combo:

if value not in self.combination$\_$set:

return

self.current$\_$combination $=$ list$($combo$)$

def print$\_$all$\_$combinations$($self$)$:

#TODO: Make sure you start at the beginning $($see the

# reset$\_$combination method$)$

#TODO: Print combination

#TODO: Generate a next Combination

#TODO: Repeat $($It helps if your next$\_$combination method returns a boolean$)$

self.reset$\_$combination$()$

while True:

print$($self$.$current$\_$combination$)$

if not self.next$\_$combination$()$:

break

# pass

def next$\_$combination$($self$)$:

#TODO: Move from right to left in both the

# currentCombination and the combinationSet

# until the numbers do not match. $($Hint$,$ use negative indexing$)$

#TODO: Find startPos as $1$ plus the position of the

# number from the current combination that did

# not match in the combinationSet. Fill in

# from left to right in the currentCombination

# starting at the position of the mismatch the

# numbers from the combinationSet starting at

# the startPos you just found

#TODO: If there was no mismatch start combination over at the

# first subset. $($see the reset$\_$combination method$).$

# It is helpful to return a boolean indicating if the combination has been reset.

# let p be a sequence representing the current permutation, with k representing the index

# starting from end of sequence, move to left until value of p$[$k$]$ is less than value of p$[$k$+1]$

#use startPos to track p$[$k$]$

startPos $=-1$

#create temporary combination$\_$set list to compare against current$\_$combination

if len$($self$.$combination$\_$set$)!=$ len$($self$.$current$\_$combination$)$:

tempCombinationSet $=$ self.combination$\_$set$[$len$($self$.$current$\_$combination$)$:$]$

else:

tempCombinationSet $=$ self.combination$\_$set

for i in range$($len$($self$.$current$\_$combination$)-1,-1,-1)$:

if self.current$\_$combination$[$i$]!=$ tempCombinationSet$[$i$]$:

startPos $=$ i

break

elif self.current$\_$combination$[$i$]!=$ tempCombinationSet$[$i$]$:

self.reset$\_$combination$()$

return False

#determine amount to increment sub$-$list by

step $=$ tempCombinationSet$[1]-$ tempCombinationSet$[0]$

#increment startPos and sub$-$list after

if self.current$\_$combination$[$startPos$]!=$ tempCombinationSet$[$len$($tempCombinationSet$)-1]$:

self.current$\_$combination$[$startPos$]+=$ step

if self.current$\_$combination$[$startPos$]!=$ self.current$\_$combination$[$len$($self$.$current$\_$combination$)-1]$:

#increment everything after startPos

for i in range$($startPos $+1,$ len$($self$.$current$\_$combination$))$:

self.current$\_$combination$[$i$]=$ self.current$\_$combination$[$i$-1]+$ step

return True

elif self.current$\_$combination$[$startPos$]==$ tempCombinationSet$[$len$($tempCombinationSet$)-1]$:

self.reset$\_$combination$()$

print$($self$.$current$\_$combination$)$

return False