Write an oz program (having an oz recursive function/procedure) which takes in the input a list, say l, and two positive integers, m and n. the function should return another list l’, which represents the sub-list of l containing all the elements from index m to index n in reverse order. for example, if the input list is [a 2 g 5 4 k] and m is 2 and n is 5, then the output list should be [4 5 g 2]. try to cover as many margin cases as possible (e. g., m > n).

answer:

an example of solubility is salt or sugar dissolving in water.

rate as brainliest plz

answer:

design model: consists of design geometry; can be 2d or 3d; typically has a black background.

design files: drawing created with microsoft expression design, a drawing and design program for windows; may contain both vector and raster graphics; can also include multiple layers and various image effects.

elements: an element is a single part of a larger group.

answer:

just reverse the digits.

: )