$1.)$ a$.(10$ pts$.)$ Construct the adjacency list and adjacency matrix representation of the following directed graph. Yandaki y$$nl$$ grafin kom$$uluk listesi ve kom$$uluk matrisi g$$sterimlerini yaz$$n$$z$.$

b$.$ pts$.)$ Write a function that returns the number of edges in a directed graph which is implemented by adjacency list.

$2.).)$Write a function change$($int heap$[],$ int $m,$ int value$)$ that receives a minimum heap as array and integers $m$ and value to change the element at index $m$ by value. Note that you must maintain heap order property. The number of elements in the heap is $n.$

Dizi ile implemente edilmi$$ bir minimum heap ile iki adet $(m$ ve value$)$ tamsay$$ de$$erleri alan change$($int heap$[],$ int int value$)$ fonksiyonu yaz$$n$$z$.$yle ki bu fonksiyon $m$ indisindeki eleman$$n de$$erini value ile de$$i$$tiriyor$.$ Heap order $$zelli$$inin sa$$lan$$p sa$$lanmad$$na dikkat edin. Heap deki eleman say$$s$n$ dir.

$3.$ pts$.)$ Write a $C$ function to find and print the path to insert a node into a BST starting from the root. The function will not insert. For example, if you call print path $(20)$ for the following BST$,$ the function will print out as follows

To the left of $50$

To the right of $17$

To the left of $23$

To the right of $19$