Describing algorithm: in some problems you may be asked to describe an algorithm. your descript should be in the form of a short essay. the essay should include the following: a description of the algorithm in pseudo code how your algorithm works? demonstrate your algorithm using one worked example or diagram a proof (or indication) of the correctness of the algorithm an analysis of the running time of the algorithm given n files fl, f3 of length ml, , the optimal tape-storage problem is to find which order is the best to store them on a tape to get minimum cost of total retrieval time, assuming that each retrieval starts with the tape rewound, each retrieval takes time equal to the length of the preceding files in the tape plus the length of the retrieval file, and that files are to be retrieved in reverse order. the greedy algorithm put the files on the tape in ascending order of size. prove that this is the best order.