Given a collection of n pegs and a collection of n holes, arranged in an increasing order of size, give an o(n) (big o) time algorithm to determine if there is a peg and a hole that are the same size. the sizes of the pegs and holes are stored in two arrays, pegs[1..n] and holes[1..n]

since it can be assumed that what aslam is making is a template by compiling all the commonly used excel formatting in several worksheets in an excel document, aslam can choose to save it using the .xltx or .xltm format instead. thus, aslam can distribute the templates he has made to his team members in an easier manner.

answer; i think/believe the correct answer is balance sheet;