Nested lists
Write a function that nests the elements of a list one level deeper by repeating that element inside a new list a given number of times.
Examples
(nest [:a :b :c] 2) ;=> ((:a :a) (:b :b) (:c :c))
(nest [] 10) ;=> ()
(nest [1 2 3 4] 1) ;=> ((1) (2) (3) (4))
(nest [1 2 3] 0) ;=> (()()())
Thanks to this site for the challenge idea where it is considered Hard in Java.
Please submit your solutions as comments on this gist.
@Toni-zgz Welcome to Clojure! Since you asked for some suggestions:
```clojure
as the first line and```
as the last line. See the Github docs on syntax hightlightingmap
on an empty collection will evaluate to an empty sequence. You don't need to explicitly check for an empty input collection in your answer.