a) It is a common practice to use a symbolic representation of machine instructions to write a 2+2+3+ machine-language program. Consider the following high-level language instruction: X=DEF(A+BC)(G+IH) i. What are the common sources of these operands? ii. What are the basic elements of a machine instruction? iii. Draw an instruction cycle state diagram showing all the steps involved in instruction execution iv. Write two separate programs using two- and one-address machine instruction formats respectively to compute the above expression. Values of given operands should not be changed during execution. A procedure is the most significant invention in the evolution of programming languages. It is an independent computer program that is embedded within a bigger program. The procedure may be invoked or called at any time within the program. An example program where procedures are called multiple times during its execution is illustrated in Figure 1. Figure 1: A program with procedure calls. i. Draw an execution sequence diagram illustrating how the procedures are called at different addresses during program execution. ii. Based on the given scenario, demonstrate how a processor employs a stack data structure to store return addresses and implement nested procedure calls