Restricted $k$-clique:Input: $(G,v,k)$ where $v$ is vertex in $V$Output: k-clique containing vertex $v$. What is the space and time complexity status of this Restricted $k$-clique problem? Is it same as $k$-clique problem?I trying to show this problem is in $L$ or $NL$ 
Complexity status of restricted k-clique
ds.algorithms;graph algorithms;time complexity;space complexity;logspace