Question Write a function findpat that takes a long binar

## Question:

## Write a function \"findpat\" that takes a

## long binary pattern in $a0 and a smaller

## binary pattern in $a1, and returns true

## if the long binary pattern contains the

## smaller one.

## For example 100111 base two contains 1001.

##

## Output format must be:

## \"Pattern found\"

main:# execution starts here

li $a0,39

li $a1,9

jal findpat# call function

beqz $v0,notthere

la $a0,yes

li $v0,4

syscall

b exit

notthere:

la $a0,no

li $v0,4

syscall

exit:li $v0,10

syscall# au revoir...

.data

yes:.asciiz \"Pattern found\ \"

no:.asciiz \"Pattern not found\ \"

Solution

R is an implementation of the S programming language combined with lexical scoping semantics inspired by Scheme.^[11] S was created by John Chambers while at Bell Labs. There are some important differences, but much of the code written for S runs unaltered.^[12]

R was created by Ross Ihaka and Robert Gentleman^[13] at the University of Auckland, New Zealand, and is currently developed by the R Development Core Team, of which Chambers is a member. R is named partly after the first names of the first two R authors and partly as a play on the name of S.^[14] The project was conceived in 1992, with an initial version released in 1995 and a stable beta version in 2000