Write a python code to solve the following. Given an input list of strings, return a list which contains tuples of combinations of the elements in the input list taken "k" combinations at a time. For example, when input_list = ["a", "b", "c", "d"] then the output should be output_list=[('a', 'b'), ('a', 'c'), ('a', 'd'), ('b', 'c'), ('b', 'd'), ('c', 'd')] Limit your response to 350 words.
user