Create the memory diagrams to show DATA memory contents and addresses after execution of each code segment.

a)

ORG $0800

TEMP RMB 1

VAR1 FCB $14

VAR2 FCB $35

ORG $0900

NOP

LDX #TEMP

LDAA VAR1

LDAB 2,X

ABA

STAA 0,X

STD 3,X

NOP

b) ORG $C000

NUMBAS FCB 2,4,7,5,3

SUM RMB 2

LDY #NUMBAS

LDX #0

LDAA #5

LOOP LDAB 0,Y

ABX

INY

DECA

BNE LOOP

STX SUM

NOP

c)

ORG $0B00

SCALE FCB $F2

CONST RMB 1

ANSWER RMB 2

ORG $0800

LDX #SCALE

LDAA #$25

STAA CONST

LDAB 0,X

MUL

STD ANSWER

NOP

A-12.3 an american spy is deep undercover in the hostile country of phonemia. in order not to waste scarce resources, any time he wants to send a message back home, he removes all the punctuation from his message and converts all the letters to uppercase. so, for example, to send the message, “abort the plan! meet at the dark cabin.” he would transmit given such a string, s, of n uppercase letters, describe an efficient way of breaking it into a sequence of valid english words. you may assume that you have a function, valid(s), which can take a character string, s, and return true if and only if s is a valid english word. what is the running time of your algorithm, assuming each call to the function, valid, runs in o(1) time?