python

Write a function, topast, n, that returns the top n largest values from 1st. For example, top (15,1,3,6,0,12). 3) returns (12. 6,5).top(13, 3, 3, 3; 31. ) returns (3) and top (1.3) returns None If n is larger than the size of Ist, the function should return all the values in sorted order. A correct solution does not use index(), pop().remove, sort() or sorted(). However, you can use append(), max() or mino). Assumelut only contains non negative numbers