Can someone help me out with this writing assignment project? Writer's block got the best of me on this, and it's got to be on MS Word or any other word processing app. (sorry if I posted this on the wrong subject, I don't know where to put this)

Assume that you have an sorted array of records. assume that the length of the array (n) is known. give two different methods to search for a specific value in this array. you can use english or pseudo-code for your algorithm. what is the time complexity for each algorithm and why?

How is the number 372 written when expanded out to place values in the base 8 (octal) number system? a. 2 x 4 + 3 x 2 + 4 x 1 b. 3 x 64 + 7 x 8 + 2 x 1 c. 3 x 8 + 7 x 7 + 2 x 6 d. 3 x 100 + 7 x 10 + 2 x 1

Font size, font style, and are all aspects of character formatting.