Question

1. Assume there are n-tyres that could be used by car, tricycle and bicycle. Write an algorithm to accept n-tyres and generate all the combinations of cars, tricycle and bicycle that would exhaust the n-tyres.
2. Assume S is a string of lower case charcaters, write an algorithm that counts up the number of vowels contained in d string S. Output number of vowels.