a$)$

function$($int$[]$ a$)$

return a$[0]$

b$)$ Time complexity of

function$($int$[]$ a$)$

d $=$ new ArrayDeque

for$($ i$=0$; i $$ a$.$length; i$++)$

d$.$add$($d$.$size$()/2,$ a$[$i$])$

c$)$ Time complexity of

function$($int$[]$ a$)$

d $=$ new ArrayDeque

for$($ i$=0$; i $$ a$.$length; i$++)$

d$.$add$(0,$ a$[$i$])$

d$)$ Time complexity of

function$($int$[]$ a$)$

d $=$ new ArrayDeque

for$($ i$=0$; i $$ a$.$length; i$++)$

d$.$add$($i$,$ a$[$i$])$

e$)($Extra$)$ space complexity $($i$.$e$.$ not including space of array a$)$ of

function$($int$[]$ a$)$

d $=$ new ArrayDeque

for$($ i$=0$; i $$ a$.$length; i$++)$

d$.$add$($i$,$ a$[$i$])$

f$)($Extra$)$ space complexity $($i$.$e$.$ not including space of array a$)$ of

function$($int$[]$ a$)$

d $=$ new ArrayDeque

for$($ i$=0$; i $$ a$.$length; i$++)$

d$.$add$(0,$ a$[$i$])$

g$)$ Time complexity of

function$($int$[]$ a$)$

int$[]$ b $=$ new int$[$a$.$length$]$

return a$[0]$

h$)($Extra$)$ space complexity $($i$.$e$.$ not including space of array a$)$ of

function$($int$[]$ a$)$

return a$[0]$

i$)($Extra$)$ space complexity $($i$.$e$.$ not including space of array a$)$ of

function$($int$[]$ a$)$

d $=$ new ArrayDeque

for$($ i$=0$; i $$ a$.$length; i$++)$

d$.$add$($d$.$size$()/2,$ a$[$i$])$

j$)$ space$($Extra$)$ space complexity $($i$.$e$.$ not including space of array a$)$ of

function$($int$[]$ a$)$

int$[]$ b $=$ new int$[$a$.$length$]$

return a$[0]$ options: $\backslash$Theta $(1)$ time

options:

$1)\backslash$Theta $(1)$ time, $2)(1)$ space

$3)(n)$ time

$4)(n)$ space

$5)(n^2)$ time

$6)(n^2)$ spaceFor each of the following code snippets, match it to the appropriate $($worst$-$case$)$ time or space complexity,

as specified at the top of the snippet.

You should assume that the size of the input array a is $n1.$

If you're unfamiliar with $,$ you should consider looking at the Algorithms Analysis Primer in the Week $0$

sub$-$module.

Note that declaring an array of length $n$ is frequently a $(n)$ operation, as many languages $($including

many versions of Java$)$ will initialize each entry of the new array to its default value. You may assume that it

is a$)$ Time compl. for this problem.