Consider the VERTEX$-$COVER problem seen in lecture, where given a graph G $($V$,$ E$),$ one wouldlike to find the minimum cardinality subset V$\text{'}$ of V such that V$\text{'}$ is a vertex cover of G$.$ it hasbeen shown this problem is NP$.$hard in lecture. Suppose l have invented an approximation algorithm that finds a suboptimal solution to theVERTEX$-$COVER problem and i have somehow proven that this algorithm is a p$-$approximation ofthe optimal solution, What can one then conclude about the value of p$?$