python please TID of 11 digits long fits pattern "8xxxxxxxxxx". Each x is to be replaced by a digit. Determine max # of TID can be simultaneously formed from n digits. If none can be generated return 0. To note: TID does not have to be unique and does not have to be formed in the same order of digits as toChoseFrom. Ex: "8111111111181111111111" can be 2 TID each being "81111111111. toChoseFrom = 8012345678901234567890