Write an implementation of the C strlen function from scratch. Recall strlen returns the length of the string pointed to by str$.$

size$\_$t strlen$($const char $*$str$)$

Write a recursive Scheme form $($whereis x lst$)$ which returns the location of the first occurrence of x in lst$.$ If x is not in the list you can return any invalid location $($eg$.-1$ or length$+1).$ It is up to you whether to use $0-$ or $1-$based indexing.

Write a Prolog program split$($L$,$ N$,$ L$1,$ L$2)$ where L$1$ and L$2$ are the result of splitting the list L after location N$.$

Write a Scheme program $($increasing lst$)$ which returns a list that is lst with any elements removed that are not greater than the ones preceding it$.$ For example:

$($increasing $\text{'}())->()$

$($increasing $\text{'}(1))->(1)$

$($increasing $\text{'}(1-23-45))->(135)$

$($increasing $\text{'}(54321))->(5)$

$($increasing $\text{'}(12345))->(12345)$

Write a procedure that takes a list$/$array of numbers and adds the index of the location to each number in the list$/$array$.$ For example: $1,2,3->1,3,5($or $2,4,6)$

C $($array$)$

C$++($vector$)$

Scheme

Prolog