I am new to pseudocode and completely computer science idiot ! need help urgently for answers for following questions:

1.) Design an algorithm for finding all the factors of apositive integer. For example, in the case of the integer 12, your algorithm should report the values 1,2,3,4,6, and 12.

2.) The following is an addition problem in traditional base ten notation. Each letter represents a different digit. What digit does each letter represent? how did hyou get your foot in the door?

XYZ

+ YWY

_________

ZYZW

3.) What letters are interragated by the binary search if it is applied to the list A, B, C, D, E, F, G, H, I, J, K, L, M, N, O when searching for the value J ? what abot searching for the value Z ?

4.) After performing many sequential searches on a list of 6,000 entries, what would you expect to be the average number of times that the target value would have been compared to a list entry? What if the search algorithm was the binary search ?

5.) What problems do you expect to arise if the following program is implemented on a computer ? (Hint: Remember the problem of round-off errors associated with floating-point arithmetic.)

Countnt <---one-tenth

repeat

(print the value assigned to Count and

Count <---- count + one-tenth)

until (Count equals 1)