Write a function named indices with two parameters: an object, needle, and a list of objects, haystack. Your function should return the list of positions of all occurrences of needle in haystack.

For example:

>>> indices []

>>> indices []

>>> indices [0]

>>> indices

[1, 2]

>>> indices [1, 3, 5]

(7 , []) (7 , [6]) (7 , [7,8,9]) (7 , [1,7,7,6]) (7 , [0,7,1,7,2,7,3])

Notice that the output is a list of positions. That is, in the last example, the result is [1, 3, 5] because the needle 7 appears in the haystack at positions 1, 3, and 5.

Hint: youll need to iterate through the haystack, and, if a given item matches the needle, append it to an accumulator. You are prohibited from using Pythons built-in searching methods, such as index. You are, however, permitted to use the indexing operator.

Your function should not use print or input at all. Test your code thoroughly before submitting it.