Given a non-negative int n. Create and return a list of fists like this: [[1, 2, 3, . n). [1, 2 -1), ..[1, 2], [13). There will be nists nested inside the outer ist. Use nested range loops. Run code Not Correct X 100000 def nested:20): call got expect nested2() OO nested2(1) 013] nested2C2) [1, 2], [13] nested2(3) [[1, 2, 3), [1, 2], [1]] d2C4) [1, 2, 3, 4), (1, 2, 3), (1, 2), [1]] Show: Call Fna Expect Diff Print Animation nested2(5) [1, 2, 3, 4, 5]. [1, 2, 3, 4], [1, 2, 3]. [1, 2], [1]]