Write an assembly program lc$3-$edit for Given the values $$of integers in memory at addresses x$3000$ to x$3009$ and an integer K at memory location x$300$A$.$ Write an assembly language program to find two numbers X and

Y converts the property with the value farthest from K and X $<$ K and Y $>$ K$.$ Store the values $$X and Y in memory cells x$300$B$,$ x$300$C respectively. The program starts at address x$3010.$ If X$,$ Y cannot be found, the value in memory cell x$300$B$,$ x$300$C is x$0.$ Example:

X$3000$ x$17$ #$23$

X$3001$ XOC #$12$

x$3002$ x$0$E #$14$

X$3003$ x$06$ #$6$

X$3004$ x$2$B #$43$

X$3005$ x$39$ #$57$

X$3006$ x$19$ #$25$

x$3007$ x$36$ #$54$

x$3008$ x$4$C #$76$

x$3009$ x$22$ #$34$

X$300$A x$30$ #$48$

X$300$B x$06$ #$6$

x$300$C X$4$C #$76$